bigcode/the-stack-smol-xl · Datasets at Hugging Face

38bf1b1eb07d4181cad2af197cde4858204e379d

1,974

adb

Ada

boards/stm32l031_rfm69/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

boards/stm32l031_rfm69/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

boards/stm32l031_rfm69/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with STM32_SVD; use STM32_SVD; with STM32_SVD.RCC; use STM32_SVD.RCC; with STM32_SVD.GPIO; use STM32_SVD.GPIO; with STM32_SVD.PWR; use STM32_SVD.PWR; with STM32_SVD.SCB; use STM32_SVD.SCB; with STM32_SVD.Flash; use STM32_SVD.Flash; with STM32GD.Startup; package body STM32GD.Board is procedure Init is begin Clocks.Init; RCC_Periph.APB1ENR.PWREN := 1; RCC_Periph.IOPENR.IOPAEN := 1; RCC_Periph.IOPENR.IOPBEN := 1; RCC_Periph.APB2ENR.USART1EN := 1; RCC_Periph.APB2ENR.SPI1EN := 1; -- RCC_Periph.APB2ENR.ADCEN := 1; RCC_Periph.APB1ENR.I2C1EN := 1; -- BUTTON.Init; -- LED.Init; -- LED2.Init; -- LED3.Init; TX.Init; RX.Init; -- RFM69_RESET.Init; -- SCL.Init; -- SDA.Init; CSN.Init; CSN.Set; SCLK.Init; MISO.Init; MOSI.Init; IRQ.Init; USART.Init; SPI.Init; RTC.Init; -- I2C.Init; end Init; procedure Power_Down is begin RCC_Periph.IOPENR := (Reserved_5_6 => 0, Reserved_8_31 => 0, others => 1); GPIOA_Periph.MODER.Val := 16#FFFF_FFFF#; GPIOB_Periph.MODER.Val := 16#FFFF_FFFF#; GPIOC_Periph.MODER.Val := 16#FFFF_FFFF#; GPIOD_Periph.MODER.Val := 16#FFFF_FFFF#; GPIOE_Periph.MODER.Val := 16#FFFF_FFFF#; GPIOH_Periph.MODER.Val := 16#FFFF_FFFF#; RCC_Periph.IOPENR := (Reserved_5_6 => 0, Reserved_8_31 => 0, others => 0); STM32_SVD.RCC.RCC_Periph.APB2ENR.USART1EN := 0; STM32_SVD.RCC.RCC_Periph.APB2ENR.SPI1EN := 0; STM32_SVD.RCC.RCC_Periph.APB2ENR.ADCEN := 0; STM32_SVD.RCC.RCC_Periph.APB1ENR.I2C1EN := 0; end Power_Down; procedure Power_Up is begin Init; end Power_Up; procedure Stop is begin Flash_Periph.ACR.SLEEP_PD := 1; PWR_Periph.CR.LPDS := 1; PWR_Periph.CR.PDDS := 0; PWR_Periph.CR.ULP := 1; SCB_Periph.SCR.SLEEPDEEP := 1; end Stop; end STM32GD.Board;

25.973684

80

0.622087

04d6c07f45f3c7f1d9130533081ccd2d0bba07a4

35,894

ads

Ada

arch/ARM/STM32/devices/stm32f46_79x/stm32-device.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

arch/ARM/STM32/devices/stm32f46_79x/stm32-device.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

arch/ARM/STM32/devices/stm32f46_79x/stm32-device.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2018, AdaCore -- -- -- -- 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 the copyright holder 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. -- -- -- ------------------------------------------------------------------------------ -- This file provides declarations for devices on the STM32F469x and -- STM32F479x MCUs manufactured by ST Microelectronics. with STM32_SVD; use STM32_SVD; with STM32_SVD.DSI; with STM32_SVD.SAI; with STM32_SVD.SDIO; with STM32.ADC; use STM32.ADC; with STM32.DAC; use STM32.DAC; with STM32.DMA; use STM32.DMA; with STM32.DSI; use STM32.DSI; with STM32.GPIO; use STM32.GPIO; with STM32.I2C; use STM32.I2C; with STM32.I2C.DMA; use STM32.I2C.DMA; with STM32.SDMMC; use STM32.SDMMC; with STM32.SPI; use STM32.SPI; with STM32.SPI.DMA; use STM32.SPI.DMA; with STM32.I2S; use STM32.I2S; with STM32.Timers; use STM32.Timers; with STM32.USARTs; use STM32.USARTs; with STM32.RTC; use STM32.RTC; with STM32.CRC; use STM32.CRC; package STM32.Device is pragma Elaborate_Body; Unknown_Device : exception; -- Raised by the routines below for a device passed as an actual parameter -- when that device is not present on the given hardware instance. procedure Enable_Clock (This : aliased in out GPIO_Port) with Inline; procedure Enable_Clock (Point : GPIO_Point) with Inline; procedure Enable_Clock (Points : GPIO_Points) with Inline; procedure Reset (This : aliased in out GPIO_Port) with Inline; procedure Reset (Point : GPIO_Point) with Inline; procedure Reset (Points : GPIO_Points) with Inline; GPIO_A : aliased GPIO_Port with Import, Volatile, Address => GPIOA_Base; GPIO_B : aliased GPIO_Port with Import, Volatile, Address => GPIOB_Base; GPIO_C : aliased GPIO_Port with Import, Volatile, Address => GPIOC_Base; GPIO_D : aliased GPIO_Port with Import, Volatile, Address => GPIOD_Base; GPIO_E : aliased GPIO_Port with Import, Volatile, Address => GPIOE_Base; GPIO_F : aliased GPIO_Port with Import, Volatile, Address => GPIOF_Base; GPIO_G : aliased GPIO_Port with Import, Volatile, Address => GPIOG_Base; GPIO_H : aliased GPIO_Port with Import, Volatile, Address => GPIOH_Base; GPIO_I : aliased GPIO_Port with Import, Volatile, Address => GPIOI_Base; GPIO_J : aliased GPIO_Port with Import, Volatile, Address => GPIOJ_Base; GPIO_K : aliased GPIO_Port with Import, Volatile, Address => GPIOK_Base; PA0 : aliased GPIO_Point := (GPIO_A'Access, Pin_0); PA1 : aliased GPIO_Point := (GPIO_A'Access, Pin_1); PA2 : aliased GPIO_Point := (GPIO_A'Access, Pin_2); PA3 : aliased GPIO_Point := (GPIO_A'Access, Pin_3); PA4 : aliased GPIO_Point := (GPIO_A'Access, Pin_4); PA5 : aliased GPIO_Point := (GPIO_A'Access, Pin_5); PA6 : aliased GPIO_Point := (GPIO_A'Access, Pin_6); PA7 : aliased GPIO_Point := (GPIO_A'Access, Pin_7); PA8 : aliased GPIO_Point := (GPIO_A'Access, Pin_8); PA9 : aliased GPIO_Point := (GPIO_A'Access, Pin_9); PA10 : aliased GPIO_Point := (GPIO_A'Access, Pin_10); PA11 : aliased GPIO_Point := (GPIO_A'Access, Pin_11); PA12 : aliased GPIO_Point := (GPIO_A'Access, Pin_12); PA13 : aliased GPIO_Point := (GPIO_A'Access, Pin_13); PA14 : aliased GPIO_Point := (GPIO_A'Access, Pin_14); PA15 : aliased GPIO_Point := (GPIO_A'Access, Pin_15); PB0 : aliased GPIO_Point := (GPIO_B'Access, Pin_0); PB1 : aliased GPIO_Point := (GPIO_B'Access, Pin_1); PB2 : aliased GPIO_Point := (GPIO_B'Access, Pin_2); PB3 : aliased GPIO_Point := (GPIO_B'Access, Pin_3); PB4 : aliased GPIO_Point := (GPIO_B'Access, Pin_4); PB5 : aliased GPIO_Point := (GPIO_B'Access, Pin_5); PB6 : aliased GPIO_Point := (GPIO_B'Access, Pin_6); PB7 : aliased GPIO_Point := (GPIO_B'Access, Pin_7); PB8 : aliased GPIO_Point := (GPIO_B'Access, Pin_8); PB9 : aliased GPIO_Point := (GPIO_B'Access, Pin_9); PB10 : aliased GPIO_Point := (GPIO_B'Access, Pin_10); PB11 : aliased GPIO_Point := (GPIO_B'Access, Pin_11); PB12 : aliased GPIO_Point := (GPIO_B'Access, Pin_12); PB13 : aliased GPIO_Point := (GPIO_B'Access, Pin_13); PB14 : aliased GPIO_Point := (GPIO_B'Access, Pin_14); PB15 : aliased GPIO_Point := (GPIO_B'Access, Pin_15); PC0 : aliased GPIO_Point := (GPIO_C'Access, Pin_0); PC1 : aliased GPIO_Point := (GPIO_C'Access, Pin_1); PC2 : aliased GPIO_Point := (GPIO_C'Access, Pin_2); PC3 : aliased GPIO_Point := (GPIO_C'Access, Pin_3); PC4 : aliased GPIO_Point := (GPIO_C'Access, Pin_4); PC5 : aliased GPIO_Point := (GPIO_C'Access, Pin_5); PC6 : aliased GPIO_Point := (GPIO_C'Access, Pin_6); PC7 : aliased GPIO_Point := (GPIO_C'Access, Pin_7); PC8 : aliased GPIO_Point := (GPIO_C'Access, Pin_8); PC9 : aliased GPIO_Point := (GPIO_C'Access, Pin_9); PC10 : aliased GPIO_Point := (GPIO_C'Access, Pin_10); PC11 : aliased GPIO_Point := (GPIO_C'Access, Pin_11); PC12 : aliased GPIO_Point := (GPIO_C'Access, Pin_12); PC13 : aliased GPIO_Point := (GPIO_C'Access, Pin_13); PC14 : aliased GPIO_Point := (GPIO_C'Access, Pin_14); PC15 : aliased GPIO_Point := (GPIO_C'Access, Pin_15); PD0 : aliased GPIO_Point := (GPIO_D'Access, Pin_0); PD1 : aliased GPIO_Point := (GPIO_D'Access, Pin_1); PD2 : aliased GPIO_Point := (GPIO_D'Access, Pin_2); PD3 : aliased GPIO_Point := (GPIO_D'Access, Pin_3); PD4 : aliased GPIO_Point := (GPIO_D'Access, Pin_4); PD5 : aliased GPIO_Point := (GPIO_D'Access, Pin_5); PD6 : aliased GPIO_Point := (GPIO_D'Access, Pin_6); PD7 : aliased GPIO_Point := (GPIO_D'Access, Pin_7); PD8 : aliased GPIO_Point := (GPIO_D'Access, Pin_8); PD9 : aliased GPIO_Point := (GPIO_D'Access, Pin_9); PD10 : aliased GPIO_Point := (GPIO_D'Access, Pin_10); PD11 : aliased GPIO_Point := (GPIO_D'Access, Pin_11); PD12 : aliased GPIO_Point := (GPIO_D'Access, Pin_12); PD13 : aliased GPIO_Point := (GPIO_D'Access, Pin_13); PD14 : aliased GPIO_Point := (GPIO_D'Access, Pin_14); PD15 : aliased GPIO_Point := (GPIO_D'Access, Pin_15); PE0 : aliased GPIO_Point := (GPIO_E'Access, Pin_0); PE1 : aliased GPIO_Point := (GPIO_E'Access, Pin_1); PE2 : aliased GPIO_Point := (GPIO_E'Access, Pin_2); PE3 : aliased GPIO_Point := (GPIO_E'Access, Pin_3); PE4 : aliased GPIO_Point := (GPIO_E'Access, Pin_4); PE5 : aliased GPIO_Point := (GPIO_E'Access, Pin_5); PE6 : aliased GPIO_Point := (GPIO_E'Access, Pin_6); PE7 : aliased GPIO_Point := (GPIO_E'Access, Pin_7); PE8 : aliased GPIO_Point := (GPIO_E'Access, Pin_8); PE9 : aliased GPIO_Point := (GPIO_E'Access, Pin_9); PE10 : aliased GPIO_Point := (GPIO_E'Access, Pin_10); PE11 : aliased GPIO_Point := (GPIO_E'Access, Pin_11); PE12 : aliased GPIO_Point := (GPIO_E'Access, Pin_12); PE13 : aliased GPIO_Point := (GPIO_E'Access, Pin_13); PE14 : aliased GPIO_Point := (GPIO_E'Access, Pin_14); PE15 : aliased GPIO_Point := (GPIO_E'Access, Pin_15); PF0 : aliased GPIO_Point := (GPIO_F'Access, Pin_0); PF1 : aliased GPIO_Point := (GPIO_F'Access, Pin_1); PF2 : aliased GPIO_Point := (GPIO_F'Access, Pin_2); PF3 : aliased GPIO_Point := (GPIO_F'Access, Pin_3); PF4 : aliased GPIO_Point := (GPIO_F'Access, Pin_4); PF5 : aliased GPIO_Point := (GPIO_F'Access, Pin_5); PF6 : aliased GPIO_Point := (GPIO_F'Access, Pin_6); PF7 : aliased GPIO_Point := (GPIO_F'Access, Pin_7); PF8 : aliased GPIO_Point := (GPIO_F'Access, Pin_8); PF9 : aliased GPIO_Point := (GPIO_F'Access, Pin_9); PF10 : aliased GPIO_Point := (GPIO_F'Access, Pin_10); PF11 : aliased GPIO_Point := (GPIO_F'Access, Pin_11); PF12 : aliased GPIO_Point := (GPIO_F'Access, Pin_12); PF13 : aliased GPIO_Point := (GPIO_F'Access, Pin_13); PF14 : aliased GPIO_Point := (GPIO_F'Access, Pin_14); PF15 : aliased GPIO_Point := (GPIO_F'Access, Pin_15); PG0 : aliased GPIO_Point := (GPIO_G'Access, Pin_0); PG1 : aliased GPIO_Point := (GPIO_G'Access, Pin_1); PG2 : aliased GPIO_Point := (GPIO_G'Access, Pin_2); PG3 : aliased GPIO_Point := (GPIO_G'Access, Pin_3); PG4 : aliased GPIO_Point := (GPIO_G'Access, Pin_4); PG5 : aliased GPIO_Point := (GPIO_G'Access, Pin_5); PG6 : aliased GPIO_Point := (GPIO_G'Access, Pin_6); PG7 : aliased GPIO_Point := (GPIO_G'Access, Pin_7); PG8 : aliased GPIO_Point := (GPIO_G'Access, Pin_8); PG9 : aliased GPIO_Point := (GPIO_G'Access, Pin_9); PG10 : aliased GPIO_Point := (GPIO_G'Access, Pin_10); PG11 : aliased GPIO_Point := (GPIO_G'Access, Pin_11); PG12 : aliased GPIO_Point := (GPIO_G'Access, Pin_12); PG13 : aliased GPIO_Point := (GPIO_G'Access, Pin_13); PG14 : aliased GPIO_Point := (GPIO_G'Access, Pin_14); PG15 : aliased GPIO_Point := (GPIO_G'Access, Pin_15); PH0 : aliased GPIO_Point := (GPIO_H'Access, Pin_0); PH1 : aliased GPIO_Point := (GPIO_H'Access, Pin_1); PH2 : aliased GPIO_Point := (GPIO_H'Access, Pin_2); PH3 : aliased GPIO_Point := (GPIO_H'Access, Pin_3); PH4 : aliased GPIO_Point := (GPIO_H'Access, Pin_4); PH5 : aliased GPIO_Point := (GPIO_H'Access, Pin_5); PH6 : aliased GPIO_Point := (GPIO_H'Access, Pin_6); PH7 : aliased GPIO_Point := (GPIO_H'Access, Pin_7); PH8 : aliased GPIO_Point := (GPIO_H'Access, Pin_8); PH9 : aliased GPIO_Point := (GPIO_H'Access, Pin_9); PH10 : aliased GPIO_Point := (GPIO_H'Access, Pin_10); PH11 : aliased GPIO_Point := (GPIO_H'Access, Pin_11); PH12 : aliased GPIO_Point := (GPIO_H'Access, Pin_12); PH13 : aliased GPIO_Point := (GPIO_H'Access, Pin_13); PH14 : aliased GPIO_Point := (GPIO_H'Access, Pin_14); PH15 : aliased GPIO_Point := (GPIO_H'Access, Pin_15); PI0 : aliased GPIO_Point := (GPIO_I'Access, Pin_0); PI1 : aliased GPIO_Point := (GPIO_I'Access, Pin_1); PI2 : aliased GPIO_Point := (GPIO_I'Access, Pin_2); PI3 : aliased GPIO_Point := (GPIO_I'Access, Pin_3); PI4 : aliased GPIO_Point := (GPIO_I'Access, Pin_4); PI5 : aliased GPIO_Point := (GPIO_I'Access, Pin_5); PI6 : aliased GPIO_Point := (GPIO_I'Access, Pin_6); PI7 : aliased GPIO_Point := (GPIO_I'Access, Pin_7); PI8 : aliased GPIO_Point := (GPIO_I'Access, Pin_8); PI9 : aliased GPIO_Point := (GPIO_I'Access, Pin_9); PI10 : aliased GPIO_Point := (GPIO_I'Access, Pin_10); PI11 : aliased GPIO_Point := (GPIO_I'Access, Pin_11); PI12 : aliased GPIO_Point := (GPIO_I'Access, Pin_12); PI13 : aliased GPIO_Point := (GPIO_I'Access, Pin_13); PI14 : aliased GPIO_Point := (GPIO_I'Access, Pin_14); PI15 : aliased GPIO_Point := (GPIO_I'Access, Pin_15); PJ0 : aliased GPIO_Point := (GPIO_J'Access, Pin_0); PJ1 : aliased GPIO_Point := (GPIO_J'Access, Pin_1); PJ2 : aliased GPIO_Point := (GPIO_J'Access, Pin_2); PJ3 : aliased GPIO_Point := (GPIO_J'Access, Pin_3); PJ4 : aliased GPIO_Point := (GPIO_J'Access, Pin_4); PJ5 : aliased GPIO_Point := (GPIO_J'Access, Pin_5); PJ6 : aliased GPIO_Point := (GPIO_J'Access, Pin_6); PJ7 : aliased GPIO_Point := (GPIO_J'Access, Pin_7); PJ8 : aliased GPIO_Point := (GPIO_J'Access, Pin_8); PJ9 : aliased GPIO_Point := (GPIO_J'Access, Pin_9); PJ10 : aliased GPIO_Point := (GPIO_J'Access, Pin_10); PJ11 : aliased GPIO_Point := (GPIO_J'Access, Pin_11); PJ12 : aliased GPIO_Point := (GPIO_J'Access, Pin_12); PJ13 : aliased GPIO_Point := (GPIO_J'Access, Pin_13); PJ14 : aliased GPIO_Point := (GPIO_J'Access, Pin_14); PJ15 : aliased GPIO_Point := (GPIO_J'Access, Pin_15); PK0 : aliased GPIO_Point := (GPIO_K'Access, Pin_0); PK1 : aliased GPIO_Point := (GPIO_K'Access, Pin_1); PK2 : aliased GPIO_Point := (GPIO_K'Access, Pin_2); PK3 : aliased GPIO_Point := (GPIO_K'Access, Pin_3); PK4 : aliased GPIO_Point := (GPIO_K'Access, Pin_4); PK5 : aliased GPIO_Point := (GPIO_K'Access, Pin_5); PK6 : aliased GPIO_Point := (GPIO_K'Access, Pin_6); PK7 : aliased GPIO_Point := (GPIO_K'Access, Pin_7); PK8 : aliased GPIO_Point := (GPIO_K'Access, Pin_8); PK9 : aliased GPIO_Point := (GPIO_K'Access, Pin_9); PK10 : aliased GPIO_Point := (GPIO_K'Access, Pin_10); PK11 : aliased GPIO_Point := (GPIO_K'Access, Pin_11); PK12 : aliased GPIO_Point := (GPIO_K'Access, Pin_12); PK13 : aliased GPIO_Point := (GPIO_K'Access, Pin_13); PK14 : aliased GPIO_Point := (GPIO_K'Access, Pin_14); PK15 : aliased GPIO_Point := (GPIO_K'Access, Pin_15); GPIO_AF_RTC_50Hz_0 : constant GPIO_Alternate_Function; GPIO_AF_MCO_0 : constant GPIO_Alternate_Function; GPIO_AF_TAMPER_0 : constant GPIO_Alternate_Function; GPIO_AF_SWJ_0 : constant GPIO_Alternate_Function; GPIO_AF_TRACE_0 : constant GPIO_Alternate_Function; GPIO_AF_TIM1_1 : constant GPIO_Alternate_Function; GPIO_AF_TIM2_1 : constant GPIO_Alternate_Function; GPIO_AF_I2C4_1 : constant GPIO_Alternate_Function; GPIO_AF_UART5_1 : constant GPIO_Alternate_Function; GPIO_AF_TIM3_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM4_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM5_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM8_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM9_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM10_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM11_3 : constant GPIO_Alternate_Function; GPIO_AF_LPTIM1_3 : constant GPIO_Alternate_Function; GPIO_AF_DFSDM1_3 : constant GPIO_Alternate_Function; GPIO_AF_CEC_3 : constant GPIO_Alternate_Function; GPIO_AF_I2C1_4 : constant GPIO_Alternate_Function; GPIO_AF_I2C2_4 : constant GPIO_Alternate_Function; GPIO_AF_I2C3_4 : constant GPIO_Alternate_Function; GPIO_AF_I2C4_4 : constant GPIO_Alternate_Function; GPIO_AF_USART1_4 : constant GPIO_Alternate_Function; GPIO_AF_CEC_4 : constant GPIO_Alternate_Function; GPIO_AF_SPI1_5 : constant GPIO_Alternate_Function; GPIO_AF_I2S1_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI2_5 : constant GPIO_Alternate_Function; GPIO_AF_I2S2_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI3_5 : constant GPIO_Alternate_Function; GPIO_AF_I2S3_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI4_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI5_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI6_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI2_6 : constant GPIO_Alternate_Function; GPIO_AF_I2S2_6 : constant GPIO_Alternate_Function; GPIO_AF_SPI3_6 : constant GPIO_Alternate_Function; GPIO_AF_I2S3_6 : constant GPIO_Alternate_Function; GPIO_AF_SAI1_6 : constant GPIO_Alternate_Function; GPIO_AF_UART4_6 : constant GPIO_Alternate_Function; GPIO_AF_DFSDM1_6 : constant GPIO_Alternate_Function; GPIO_AF_SPI2_7 : constant GPIO_Alternate_Function; GPIO_AF_I2S2_7 : constant GPIO_Alternate_Function; GPIO_AF_SPI3_7 : constant GPIO_Alternate_Function; GPIO_AF_I2S3_7 : constant GPIO_Alternate_Function; GPIO_AF_SPI6_7 : constant GPIO_Alternate_Function; GPIO_AF_USART1_7 : constant GPIO_Alternate_Function; GPIO_AF_USART2_7 : constant GPIO_Alternate_Function; GPIO_AF_USART3_7 : constant GPIO_Alternate_Function; GPIO_AF_UART5_7 : constant GPIO_Alternate_Function; GPIO_AF_DFSDM1_7 : constant GPIO_Alternate_Function; GPIO_AF_SPDIF_7 : constant GPIO_Alternate_Function; GPIO_AF_SPI6_8 : constant GPIO_Alternate_Function; GPIO_AF_SAI2_8 : constant GPIO_Alternate_Function; GPIO_AF_UART4_8 : constant GPIO_Alternate_Function; GPIO_AF_UART5_8 : constant GPIO_Alternate_Function; GPIO_AF_USART6_8 : constant GPIO_Alternate_Function; GPIO_AF_UART7_8 : constant GPIO_Alternate_Function; GPIO_AF_UART8_8 : constant GPIO_Alternate_Function; GPIO_AF_OTG_FS_8 : constant GPIO_Alternate_Function; GPIO_AF_SPDIF_8 : constant GPIO_Alternate_Function; GPIO_AF_CAN1_9 : constant GPIO_Alternate_Function; GPIO_AF_CAN2_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM12_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM13_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM14_9 : constant GPIO_Alternate_Function; GPIO_AF_QUADSPI_9 : constant GPIO_Alternate_Function; GPIO_AF_FMC_9 : constant GPIO_Alternate_Function; GPIO_AF_LTDC_9 : constant GPIO_Alternate_Function; GPIO_AF_SAI2_10 : constant GPIO_Alternate_Function; GPIO_AF_QUADSPI_10 : constant GPIO_Alternate_Function; GPIO_AF_DFSDM1_10 : constant GPIO_Alternate_Function; GPIO_AF_OTG1_FS_10 : constant GPIO_Alternate_Function; GPIO_AF_OTG_HS_10 : constant GPIO_Alternate_Function; GPIO_AF_LTDC_10 : constant GPIO_Alternate_Function; GPIO_AF_I2C4_11 : constant GPIO_Alternate_Function; GPIO_AF_CAN3_11 : constant GPIO_Alternate_Function; GPIO_AF_SDMMC2_11 : constant GPIO_Alternate_Function; GPIO_AF_ETH_11 : constant GPIO_Alternate_Function; GPIO_AF_UART7_12 : constant GPIO_Alternate_Function; GPIO_AF_FMC_12 : constant GPIO_Alternate_Function; GPIO_AF_SDIO_12 : constant GPIO_Alternate_Function; GPIO_AF_MDIOS_12 : constant GPIO_Alternate_Function; GPIO_AF_OTG2_FS_12 : constant GPIO_Alternate_Function; GPIO_AF_DCMI_13 : constant GPIO_Alternate_Function; GPIO_AF_DSI_13 : constant GPIO_Alternate_Function; GPIO_AF_LTDC_13 : constant GPIO_Alternate_Function; GPIO_AF_LTDC_14 : constant GPIO_Alternate_Function; GPIO_AF_EVENTOUT_15 : constant GPIO_Alternate_Function; function GPIO_Port_Representation (Port : GPIO_Port) return UInt4 with Inline; ADC_1 : aliased Analog_To_Digital_Converter with Import, Volatile, Address => ADC1_Base; ADC_2 : aliased Analog_To_Digital_Converter with Import, Volatile, Address => ADC2_Base; ADC_3 : aliased Analog_To_Digital_Converter with Import, Volatile, Address => ADC3_Base; VBat : constant ADC_Point := (ADC_1'Access, Channel => VBat_Channel); Temperature_Sensor : constant ADC_Point := VBat; -- see RM pg 410, section 13.10, also pg 389 VBat_Bridge_Divisor : constant := 4; -- The VBAT pin is internally connected to a bridge divider. The actual -- voltage is the raw conversion value * the divisor. See section 13.11, -- pg 412 of the RM. procedure Enable_Clock (This : aliased in out Analog_To_Digital_Converter); procedure Reset_All_ADC_Units; DAC_1 : aliased Digital_To_Analog_Converter with Import, Volatile, Address => DAC_Base; DAC_Channel_1_IO : constant GPIO_Point := PA4; DAC_Channel_2_IO : constant GPIO_Point := PA5; procedure Enable_Clock (This : aliased in out Digital_To_Analog_Converter); procedure Reset (This : aliased in out Digital_To_Analog_Converter); Internal_USART_1 : aliased Internal_USART with Import, Volatile, Address => USART1_Base; Internal_USART_2 : aliased Internal_USART with Import, Volatile, Address => USART2_Base; Internal_USART_3 : aliased Internal_USART with Import, Volatile, Address => USART3_Base; Internal_UART_4 : aliased Internal_USART with Import, Volatile, Address => UART4_Base; Internal_UART_5 : aliased Internal_USART with Import, Volatile, Address => UART5_Base; Internal_USART_6 : aliased Internal_USART with Import, Volatile, Address => USART6_Base; USART_1 : aliased USART (Internal_USART_1'Access); USART_2 : aliased USART (Internal_USART_2'Access); USART_3 : aliased USART (Internal_USART_3'Access); UART_4 : aliased USART (Internal_UART_4'Access); UART_5 : aliased USART (Internal_UART_5'Access); USART_6 : aliased USART (Internal_USART_6'Access); procedure Enable_Clock (This : aliased in out USART); procedure Reset (This : aliased in out USART); DMA_1 : aliased DMA_Controller with Import, Volatile, Address => DMA1_Base; DMA_2 : aliased DMA_Controller with Import, Volatile, Address => DMA2_Base; procedure Enable_Clock (This : aliased in out DMA_Controller); procedure Reset (This : aliased in out DMA_Controller); Internal_I2C_Port_1 : aliased Internal_I2C_Port with Import, Volatile, Address => I2C1_Base; Internal_I2C_Port_2 : aliased Internal_I2C_Port with Import, Volatile, Address => I2C2_Base; Internal_I2C_Port_3 : aliased Internal_I2C_Port with Import, Volatile, Address => I2C3_Base; type I2C_Port_Id is (I2C_Id_1, I2C_Id_2, I2C_Id_3); I2C_1 : aliased I2C_Port (Internal_I2C_Port_1'Access); I2C_2 : aliased I2C_Port (Internal_I2C_Port_2'Access); I2C_3 : aliased I2C_Port (Internal_I2C_Port_3'Access); I2C_1_DMA : aliased I2C_Port_DMA (Internal_I2C_Port_1'Access); I2C_2_DMA : aliased I2C_Port_DMA (Internal_I2C_Port_2'Access); I2C_3_DMA : aliased I2C_Port_DMA (Internal_I2C_Port_3'Access); function As_Port_Id (Port : I2C_Port'Class) return I2C_Port_Id with Inline; procedure Enable_Clock (This : I2C_Port'Class); procedure Enable_Clock (This : I2C_Port_Id); procedure Reset (This : I2C_Port'Class); procedure Reset (This : I2C_Port_Id); Internal_SPI_1 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI1_Base; Internal_SPI_2 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI2_Base; Internal_SPI_3 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI3_Base; Internal_SPI_4 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI4_Base; Internal_SPI_5 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI5_Base; Internal_SPI_6 : aliased Internal_SPI_Port with Import, Volatile, Address => SPI6_Base; SPI_1 : aliased SPI_Port (Internal_SPI_1'Access); SPI_2 : aliased SPI_Port (Internal_SPI_2'Access); SPI_3 : aliased SPI_Port (Internal_SPI_3'Access); SPI_4 : aliased SPI_Port (Internal_SPI_4'Access); SPI_5 : aliased SPI_Port (Internal_SPI_5'Access); SPI_6 : aliased SPI_Port (Internal_SPI_6'Access); SPI_1_DMA : aliased SPI_Port_DMA (Internal_SPI_1'Access); SPI_2_DMA : aliased SPI_Port_DMA (Internal_SPI_2'Access); SPI_3_DMA : aliased SPI_Port_DMA (Internal_SPI_3'Access); SPI_4_DMA : aliased SPI_Port_DMA (Internal_SPI_4'Access); SPI_5_DMA : aliased SPI_Port_DMA (Internal_SPI_5'Access); SPI_6_DMA : aliased SPI_Port_DMA (Internal_SPI_6'Access); procedure Enable_Clock (This : aliased in out SPI_Port'Class); procedure Reset (This : in out SPI_Port'Class); Internal_I2S_1 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI1_Base; Internal_I2S_2 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI2_Base; Internal_I2S_3 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI3_Base; Internal_I2S_4 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI4_Base; Internal_I2S_5 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI5_Base; Internal_I2S_6 : aliased Internal_I2S_Port with Import, Volatile, Address => SPI6_Base; Internal_I2S_2_Ext : aliased Internal_I2S_Port with Import, Volatile, Address => I2S2ext_Base; Internal_I2S_3_Ext : aliased Internal_I2S_Port with Import, Volatile, Address => I2S3ext_Base; I2S_1 : aliased I2S_Port (Internal_I2S_1'Access, Extended => False); I2S_2 : aliased I2S_Port (Internal_I2S_2'Access, Extended => False); I2S_3 : aliased I2S_Port (Internal_I2S_3'Access, Extended => False); I2S_4 : aliased I2S_Port (Internal_I2S_4'Access, Extended => False); I2S_5 : aliased I2S_Port (Internal_I2S_5'Access, Extended => False); I2S_6 : aliased I2S_Port (Internal_I2S_6'Access, Extended => False); I2S_2_Ext : aliased I2S_Port (Internal_I2S_2_Ext'Access, Extended => True); I2S_3_Ext : aliased I2S_Port (Internal_I2S_3_Ext'Access, Extended => True); procedure Enable_Clock (This : I2S_Port); procedure Reset (This : in out I2S_Port); Timer_1 : aliased Timer with Volatile, Address => TIM1_Base; pragma Import (Ada, Timer_1); Timer_2 : aliased Timer with Volatile, Address => TIM2_Base; pragma Import (Ada, Timer_2); Timer_3 : aliased Timer with Volatile, Address => TIM3_Base; pragma Import (Ada, Timer_3); Timer_4 : aliased Timer with Volatile, Address => TIM4_Base; pragma Import (Ada, Timer_4); Timer_5 : aliased Timer with Volatile, Address => TIM5_Base; pragma Import (Ada, Timer_5); Timer_6 : aliased Timer with Volatile, Address => TIM6_Base; pragma Import (Ada, Timer_6); Timer_7 : aliased Timer with Volatile, Address => TIM7_Base; pragma Import (Ada, Timer_7); Timer_8 : aliased Timer with Volatile, Address => TIM8_Base; pragma Import (Ada, Timer_8); Timer_9 : aliased Timer with Volatile, Address => TIM9_Base; pragma Import (Ada, Timer_9); Timer_10 : aliased Timer with Volatile, Address => TIM10_Base; pragma Import (Ada, Timer_10); Timer_11 : aliased Timer with Volatile, Address => TIM11_Base; pragma Import (Ada, Timer_11); Timer_12 : aliased Timer with Volatile, Address => TIM12_Base; pragma Import (Ada, Timer_12); Timer_13 : aliased Timer with Volatile, Address => TIM13_Base; pragma Import (Ada, Timer_13); Timer_14 : aliased Timer with Volatile, Address => TIM14_Base; pragma Import (Ada, Timer_14); procedure Enable_Clock (This : in out Timer); procedure Reset (This : in out Timer); -------------- -- DSI Host -- -------------- DSIHOST : aliased DSI_Host (STM32_SVD.DSI.DSI_Periph'Access); ----------- -- Audio -- ----------- subtype SAI_Port is STM32_SVD.SAI.SAI_Peripheral; SAI_1 : SAI_Port renames STM32_SVD.SAI.SAI_Periph; procedure Enable_Clock (This : in out SAI_Port); procedure Reset (This : in out SAI_Port); function Get_Input_Clock (Periph : SAI_Port) return UInt32; ----------- -- SDMMC -- ----------- SDIO : aliased SDMMC_Controller (STM32_SVD.SDIO.SDIO_Periph'Access); type SDIO_Clock_Source is (Src_Sysclk, Src_48Mhz); procedure Enable_Clock (This : in out SDMMC_Controller); procedure Reset (This : in out SDMMC_Controller); procedure Set_Clock_Source (This : in out SDMMC_Controller; Src : SDIO_Clock_Source); --------- -- CRC -- --------- CRC_Unit : CRC_32 with Import, Volatile, Address => CRC_Base; procedure Enable_Clock (This : in out CRC_32); procedure Disable_Clock (This : in out CRC_32); procedure Reset (This : in out CRC_32); ----------------------------- -- Reset and Clock Control -- ----------------------------- type RCC_System_Clocks is record SYSCLK : UInt32; HCLK : UInt32; PCLK1 : UInt32; PCLK2 : UInt32; TIMCLK1 : UInt32; TIMCLK2 : UInt32; I2SCLK : UInt32; end record; function System_Clock_Frequencies return RCC_System_Clocks; procedure Set_PLLI2S_Factors (Pll_N : UInt9; Pll_R : UInt3); function PLLI2S_Enabled return Boolean; procedure Enable_PLLI2S with Post => PLLI2S_Enabled; procedure Disable_PLLI2S with Post => not PLLI2S_Enabled; type PLLSAI_DivR is new UInt2; PLLSAI_DIV2 : constant PLLSAI_DivR := 0; PLLSAI_DIV4 : constant PLLSAI_DivR := 1; PLLSAI_DIV8 : constant PLLSAI_DivR := 2; PLLSAI_DIV16 : constant PLLSAI_DivR := 3; procedure Set_PLLSAI_Factors (LCD : UInt3; VCO : UInt9; DivR : PLLSAI_DivR); procedure Enable_PLLSAI; procedure Disable_PLLSAI; subtype DIVQ is Natural range 1 .. 32; -- procedure Enable_PLLI2S; -- procedure Disable_PLLI2S; procedure Configure_SAI_I2S_Clock (Periph : SAI_Port; PLLI2SN : UInt9; PLLI2SQ : UInt4; PLLI2SDIVQ : DIVQ); procedure Enable_DCMI_Clock; procedure Reset_DCMI; RTC : aliased RTC_Device; private GPIO_AF_RTC_50Hz_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_MCO_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TAMPER_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_SWJ_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TRACE_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TIM1_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_TIM2_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_I2C4_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_UART5_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_TIM3_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM4_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM5_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM8_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM9_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM10_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM11_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_LPTIM1_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_DFSDM1_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_CEC_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_I2C1_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_I2C2_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_I2C3_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_I2C4_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_USART1_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_CEC_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_SPI1_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_I2S1_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI2_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_I2S2_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI3_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_I2S3_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI4_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI5_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI6_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI2_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_I2S2_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_SPI3_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_I2S3_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_SAI1_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_UART4_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_DFSDM1_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_SPI2_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_I2S2_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_SPI3_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_I2S3_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_SPI6_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART1_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART2_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART3_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_UART5_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_DFSDM1_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_SPDIF_7 : constant GPIO_Alternate_Function := 8; GPIO_AF_SPI6_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_SAI2_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_UART4_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_UART5_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_USART6_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_UART7_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_UART8_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_OTG_FS_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_SPDIF_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_CAN1_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_CAN2_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM12_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM13_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM14_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_QUADSPI_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_FMC_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_LTDC_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_SAI2_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_QUADSPI_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_DFSDM1_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_OTG1_FS_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_OTG_HS_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_LTDC_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_I2C4_11 : constant GPIO_Alternate_Function := 11; GPIO_AF_CAN3_11 : constant GPIO_Alternate_Function := 11; GPIO_AF_SDMMC2_11 : constant GPIO_Alternate_Function := 11; GPIO_AF_ETH_11 : constant GPIO_Alternate_Function := 11; GPIO_AF_UART7_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_FMC_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_SDIO_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_MDIOS_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_OTG2_FS_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_DCMI_13 : constant GPIO_Alternate_Function := 13; GPIO_AF_DSI_13 : constant GPIO_Alternate_Function := 13; GPIO_AF_LTDC_13 : constant GPIO_Alternate_Function := 13; GPIO_AF_LTDC_14 : constant GPIO_Alternate_Function := 14; GPIO_AF_EVENTOUT_15 : constant GPIO_Alternate_Function := 15; end STM32.Device;

49.508966

97

0.69956

a0da5ff9434bb2c4c5e8d78556f88e3421f872a3

10,353

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sercom__mingw.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sercom__mingw.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sercom__mingw.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . S E R I A L _ C O M M U N I C A T I O N S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2007-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the Windows implementation of this package with Ada.Streams; use Ada.Streams, Ada; with System; use System; with System.Communication; use System.Communication; with System.CRTL; use System.CRTL; with System.Win32; use System.Win32; with System.Win32.Ext; use System.Win32.Ext; with GNAT.OS_Lib; package body GNAT.Serial_Communications is package OSC renames System.OS_Constants; -- Common types C_Bits : constant array (Data_Bits) of Interfaces.C.unsigned := (8, 7); C_Parity : constant array (Parity_Check) of Interfaces.C.unsigned := (None => NOPARITY, Odd => ODDPARITY, Even => EVENPARITY); C_Stop_Bits : constant array (Stop_Bits_Number) of Interfaces.C.unsigned := (One => ONESTOPBIT, Two => TWOSTOPBITS); ----------- -- Files -- ----------- procedure Raise_Error (Message : String; Error : DWORD := GetLastError); pragma No_Return (Raise_Error); ----------- -- Close -- ----------- procedure Close (Port : in out Serial_Port) is Success : BOOL; begin if Port.H /= -1 then Success := CloseHandle (HANDLE (Port.H)); if Success = Win32.FALSE then Raise_Error ("error closing the port"); end if; end if; end Close; ---------- -- Name -- ---------- function Name (Number : Positive) return Port_Name is N_Img : constant String := Positive'Image (Number); begin if Number > 9 then return Port_Name ("\\.\COM" & N_Img (N_Img'First + 1 .. N_Img'Last)); else return Port_Name ("COM" & N_Img (N_Img'First + 1 .. N_Img'Last) & ':'); end if; end Name; ---------- -- Open -- ---------- procedure Open (Port : out Serial_Port; Name : Port_Name) is C_Name : constant String := String (Name) & ASCII.NUL; Success : BOOL; pragma Unreferenced (Success); begin if Port.H /= -1 then Success := CloseHandle (HANDLE (Port.H)); end if; Port.H := CreateFileA (lpFileName => C_Name (C_Name'First)'Address, dwDesiredAccess => GENERIC_READ or GENERIC_WRITE, dwShareMode => 0, lpSecurityAttributes => null, dwCreationDisposition => OPEN_EXISTING, dwFlagsAndAttributes => 0, hTemplateFile => 0); pragma Assert (INVALID_HANDLE_VALUE = -1); if Port.H = Serial_Port_Descriptor (INVALID_HANDLE_VALUE) then Raise_Error ("cannot open com port"); end if; end Open; ----------------- -- Raise_Error -- ----------------- procedure Raise_Error (Message : String; Error : DWORD := GetLastError) is begin raise Serial_Error with Message & (if Error /= 0 then " (" & GNAT.OS_Lib.Errno_Message (Err => Integer (Error)) & ')' else ""); end Raise_Error; ---------- -- Read -- ---------- overriding procedure Read (Port : in out Serial_Port; Buffer : out Stream_Element_Array; Last : out Stream_Element_Offset) is Success : BOOL; Read_Last : aliased DWORD; begin if Port.H = -1 then Raise_Error ("read: port not opened", 0); end if; Success := ReadFile (hFile => HANDLE (Port.H), lpBuffer => Buffer (Buffer'First)'Address, nNumberOfBytesToRead => DWORD (Buffer'Length), lpNumberOfBytesRead => Read_Last'Access, lpOverlapped => null); if Success = Win32.FALSE then Raise_Error ("read error"); end if; Last := Last_Index (Buffer'First, CRTL.size_t (Read_Last)); end Read; --------- -- Set -- --------- procedure Set (Port : Serial_Port; Rate : Data_Rate := B9600; Bits : Data_Bits := CS8; Stop_Bits : Stop_Bits_Number := One; Parity : Parity_Check := None; Block : Boolean := True; Local : Boolean := True; Flow : Flow_Control := None; Timeout : Duration := 10.0) is pragma Unreferenced (Local); Success : BOOL; Com_Time_Out : aliased COMMTIMEOUTS; Com_Settings : aliased DCB; begin if Port.H = -1 then Raise_Error ("set: port not opened", 0); end if; Success := GetCommState (HANDLE (Port.H), Com_Settings'Access); if Success = Win32.FALSE then Success := CloseHandle (HANDLE (Port.H)); Raise_Error ("set: cannot get comm state"); end if; Com_Settings.BaudRate := DWORD (Data_Rate_Value (Rate)); Com_Settings.fParity := 1; Com_Settings.fBinary := Bits1 (System.Win32.TRUE); Com_Settings.fOutxDsrFlow := 0; Com_Settings.fDsrSensitivity := 0; Com_Settings.fDtrControl := OSC.DTR_CONTROL_ENABLE; Com_Settings.fInX := 0; Com_Settings.fRtsControl := OSC.RTS_CONTROL_ENABLE; case Flow is when None => Com_Settings.fOutX := 0; Com_Settings.fOutxCtsFlow := 0; when RTS_CTS => Com_Settings.fOutX := 0; Com_Settings.fOutxCtsFlow := 1; when Xon_Xoff => Com_Settings.fOutX := 1; Com_Settings.fOutxCtsFlow := 0; end case; Com_Settings.fAbortOnError := 0; Com_Settings.ByteSize := BYTE (C_Bits (Bits)); Com_Settings.Parity := BYTE (C_Parity (Parity)); Com_Settings.StopBits := BYTE (C_Stop_Bits (Stop_Bits)); Success := SetCommState (HANDLE (Port.H), Com_Settings'Access); if Success = Win32.FALSE then Success := CloseHandle (HANDLE (Port.H)); Raise_Error ("cannot set comm state"); end if; -- Set the timeout status, to honor our spec with respect to read -- timeouts. Always disconnect write timeouts. -- Blocking reads - no timeout at all if Block then Com_Time_Out := (others => 0); -- Non-blocking reads and null timeout - immediate return with what we -- have - set ReadIntervalTimeout to MAXDWORD. elsif Timeout = 0.0 then Com_Time_Out := (ReadIntervalTimeout => DWORD'Last, others => 0); -- Non-blocking reads with timeout - set total read timeout accordingly else Com_Time_Out := (ReadTotalTimeoutConstant => DWORD (1000 * Timeout), others => 0); end if; Success := SetCommTimeouts (hFile => HANDLE (Port.H), lpCommTimeouts => Com_Time_Out'Access); if Success = Win32.FALSE then Raise_Error ("cannot set the timeout"); end if; end Set; ------------ -- To_Ada -- ------------ procedure To_Ada (Port : out Serial_Port; Fd : Serial_Port_Descriptor) is begin Port.H := Fd; end To_Ada; ----------- -- Write -- ----------- overriding procedure Write (Port : in out Serial_Port; Buffer : Stream_Element_Array) is Success : BOOL; Temp_Last : aliased DWORD; begin if Port.H = -1 then Raise_Error ("write: port not opened", 0); end if; Success := WriteFile (hFile => HANDLE (Port.H), lpBuffer => Buffer'Address, nNumberOfBytesToWrite => DWORD (Buffer'Length), lpNumberOfBytesWritten => Temp_Last'Access, lpOverlapped => null); if Success = Win32.FALSE or else Stream_Element_Offset (Temp_Last) /= Buffer'Length then Raise_Error ("failed to write data"); end if; end Write; end GNAT.Serial_Communications;

32.762658

79

0.506423

5824835df4fd2dacd74b4da4f3f536d00e937120

800

ads

Ada

gnu/src/gdb/gdb/testsuite/gdb.ada/char_enum/pck.ads

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/char_enum/pck.ads

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/char_enum/pck.ads

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

-- Copyright 2011-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- 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 -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with System; package Pck is procedure Do_Nothing (A : System.Address); end Pck;

36.363636

73

0.73625

a0a0cc5d83f185e2aec546ec53c39e17e60cab42

19,742

adb

Ada

source/amf/ocl/amf-internals-ocl_operation_call_exps.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/ocl/amf-internals-ocl_operation_call_exps.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/ocl/amf-internals-ocl_operation_call_exps.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements; with AMF.Internals.Element_Collections; with AMF.Internals.Helpers; with AMF.Internals.Tables.OCL_Attributes; with AMF.OCL.Ocl_Expressions.Collections; with AMF.UML.Comments.Collections; with AMF.UML.Dependencies.Collections; with AMF.UML.Elements.Collections; with AMF.UML.Named_Elements; with AMF.UML.Namespaces.Collections; with AMF.UML.Operations; with AMF.UML.Packages.Collections; with AMF.UML.String_Expressions; with AMF.UML.Types; with AMF.Visitors.OCL_Iterators; with AMF.Visitors.OCL_Visitors; with League.Strings.Internals; with Matreshka.Internals.Strings; package body AMF.Internals.OCL_Operation_Call_Exps is ------------------ -- Get_Argument -- ------------------ overriding function Get_Argument (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.OCL.Ocl_Expressions.Collections.Ordered_Set_Of_OCL_Ocl_Expression is begin return AMF.OCL.Ocl_Expressions.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Argument (Self.Element))); end Get_Argument; ---------------------------- -- Get_Referred_Operation -- ---------------------------- overriding function Get_Referred_Operation (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Operations.UML_Operation_Access is begin return AMF.UML.Operations.UML_Operation_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Referred_Operation (Self.Element))); end Get_Referred_Operation; ---------------------------- -- Set_Referred_Operation -- ---------------------------- overriding procedure Set_Referred_Operation (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.UML.Operations.UML_Operation_Access) is begin AMF.Internals.Tables.OCL_Attributes.Internal_Set_Referred_Operation (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Referred_Operation; ---------------- -- Get_Source -- ---------------- overriding function Get_Source (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access is begin return AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Source (Self.Element))); end Get_Source; ---------------- -- Set_Source -- ---------------- overriding procedure Set_Source (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access) is begin AMF.Internals.Tables.OCL_Attributes.Internal_Set_Source (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Source; -------------- -- Get_Type -- -------------- overriding function Get_Type (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Types.UML_Type_Access is begin return AMF.UML.Types.UML_Type_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Type (Self.Element))); end Get_Type; -------------- -- Set_Type -- -------------- overriding procedure Set_Type (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.UML.Types.UML_Type_Access) is begin AMF.Internals.Tables.OCL_Attributes.Internal_Set_Type (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Type; --------------------------- -- Get_Client_Dependency -- --------------------------- overriding function Get_Client_Dependency (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is begin return AMF.UML.Dependencies.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency (Self.Element))); end Get_Client_Dependency; -------------- -- Get_Name -- -------------- overriding function Get_Name (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.Optional_String is begin declare use type Matreshka.Internals.Strings.Shared_String_Access; Aux : constant Matreshka.Internals.Strings.Shared_String_Access := AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Name; -------------- -- Set_Name -- -------------- overriding procedure Set_Name (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.Optional_String) is begin if To.Is_Empty then AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name (Self.Element, null); else AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name (Self.Element, League.Strings.Internals.Internal (To.Value)); end if; end Set_Name; ------------------------- -- Get_Name_Expression -- ------------------------- overriding function Get_Name_Expression (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access is begin return AMF.UML.String_Expressions.UML_String_Expression_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression (Self.Element))); end Get_Name_Expression; ------------------------- -- Set_Name_Expression -- ------------------------- overriding procedure Set_Name_Expression (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access) is begin AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Name_Expression; ------------------- -- Get_Namespace -- ------------------- overriding function Get_Namespace (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin return AMF.UML.Namespaces.UML_Namespace_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace (Self.Element))); end Get_Namespace; ------------------------ -- Get_Qualified_Name -- ------------------------ overriding function Get_Qualified_Name (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.Optional_String is begin declare use type Matreshka.Internals.Strings.Shared_String_Access; Aux : constant Matreshka.Internals.Strings.Shared_String_Access := AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Qualified_Name; -------------------- -- Get_Visibility -- -------------------- overriding function Get_Visibility (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Optional_UML_Visibility_Kind is begin return AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility (Self.Element); end Get_Visibility; -------------------- -- Set_Visibility -- -------------------- overriding procedure Set_Visibility (Self : not null access OCL_Operation_Call_Exp_Proxy; To : AMF.UML.Optional_UML_Visibility_Kind) is begin AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility (Self.Element, To); end Set_Visibility; ----------------------- -- Get_Owned_Comment -- ----------------------- overriding function Get_Owned_Comment (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Comments.Collections.Set_Of_UML_Comment is begin return AMF.UML.Comments.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment (Self.Element))); end Get_Owned_Comment; ----------------------- -- Get_Owned_Element -- ----------------------- overriding function Get_Owned_Element (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element is begin return AMF.UML.Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element (Self.Element))); end Get_Owned_Element; --------------- -- Get_Owner -- --------------- overriding function Get_Owner (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Elements.UML_Element_Access is begin return AMF.UML.Elements.UML_Element_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner (Self.Element))); end Get_Owner; -------------------- -- All_Namespaces -- -------------------- overriding function All_Namespaces (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.All_Namespaces"; return All_Namespaces (Self); end All_Namespaces; ------------------------- -- All_Owning_Packages -- ------------------------- overriding function All_Owning_Packages (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.All_Owning_Packages"; return All_Owning_Packages (Self); end All_Owning_Packages; ----------------------------- -- Is_Distinguishable_From -- ----------------------------- overriding function Is_Distinguishable_From (Self : not null access constant OCL_Operation_Call_Exp_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.Is_Distinguishable_From"; return Is_Distinguishable_From (Self, N, Ns); end Is_Distinguishable_From; --------------- -- Namespace -- --------------- overriding function Namespace (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.Namespace"; return Namespace (Self); end Namespace; -------------------- -- Qualified_Name -- -------------------- overriding function Qualified_Name (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return League.Strings.Universal_String is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.Qualified_Name"; return Qualified_Name (Self); end Qualified_Name; --------------- -- Separator -- --------------- overriding function Separator (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return League.Strings.Universal_String is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Separator unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.Separator"; return Separator (Self); end Separator; ------------------------ -- All_Owned_Elements -- ------------------------ overriding function All_Owned_Elements (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.All_Owned_Elements"; return All_Owned_Elements (Self); end All_Owned_Elements; ------------------- -- Must_Be_Owned -- ------------------- overriding function Must_Be_Owned (Self : not null access constant OCL_Operation_Call_Exp_Proxy) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented"); raise Program_Error with "Unimplemented procedure OCL_Operation_Call_Exp_Proxy.Must_Be_Owned"; return Must_Be_Owned (Self); end Must_Be_Owned; ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant OCL_Operation_Call_Exp_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then AMF.Visitors.OCL_Visitors.OCL_Visitor'Class (Visitor).Enter_Operation_Call_Exp (AMF.OCL.Operation_Call_Exps.OCL_Operation_Call_Exp_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant OCL_Operation_Call_Exp_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then AMF.Visitors.OCL_Visitors.OCL_Visitor'Class (Visitor).Leave_Operation_Call_Exp (AMF.OCL.Operation_Call_Exps.OCL_Operation_Call_Exp_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant OCL_Operation_Call_Exp_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then AMF.Visitors.OCL_Iterators.OCL_Iterator'Class (Iterator).Visit_Operation_Call_Exp (Visitor, AMF.OCL.Operation_Call_Exps.OCL_Operation_Call_Exp_Access (Self), Control); end if; end Visit_Element; end AMF.Internals.OCL_Operation_Call_Exps;

37.0394

110

0.611893

41f6ca4f524c0656b46acee0bcdaaa6a5152fe61

4,508

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c87b26b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c87b26b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c87b26b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C87B26B.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT 'ADDRESS, 'CONSTRAINED, 'SIZE, AND 'STORAGE_SIZE MAY BE -- USED WITH THE DESIGNATED OBJECTS OF ACCESS VALUES RETURNED FROM -- OVERLOADED FUNCTIONS, AND THAT EXPLICIT DEREFERENCING IS USED BY -- OVERLOADING RESOLUTION TO RESOLVE THE PREFIXES OF THE ATTRIBUTES. -- DSJ 22 JUN 83 -- JBG 11/22/83 -- JBG 4/23/84 -- JBG 5/25/85 WITH REPORT; WITH SYSTEM; USE REPORT; USE SYSTEM; PROCEDURE C87B26B IS TYPE REC (D : INTEGER) IS RECORD C1, C2 : INTEGER; END RECORD; TYPE P_REC IS ACCESS REC; P_REC_OBJECT : P_REC := NEW REC'(1,1,1); TYPE BIG_INT IS RANGE 0..SYSTEM.MAX_INT; TASK TYPE TASK_TYPE IS -- NOTHING AT ALL END TASK_TYPE; TYPE P_TASK IS ACCESS TASK_TYPE; P_TASK_OBJECT : P_TASK; TASK BODY TASK_TYPE IS BEGIN NULL; END TASK_TYPE; ------------------------------------------------------------ FUNCTION F RETURN REC IS BEGIN RETURN (0,0,0); END F; FUNCTION F RETURN P_REC IS BEGIN RETURN P_REC_OBJECT; END F; ------------------------------------------------------------ FUNCTION G RETURN TASK_TYPE IS NEW_TASK : TASK_TYPE; BEGIN RETURN NEW_TASK; END G; FUNCTION G RETURN P_TASK IS BEGIN RETURN P_TASK_OBJECT; END G; ------------------------------------------------------------ BEGIN TEST("C87B26B","CHECK THAT EXPLICIT DEREFERENCING IN AN " & "ATTRIBUTE PREFIX IS USED IN OVERLOADING RESOLUTION " & "WITH 'ADDRESS, 'CONSTRAINED, 'SIZE, AND 'STORAGE_SIZE"); DECLARE A : ADDRESS; -- FOR 'ADDRESS OF RECORD B : BOOLEAN; -- FOR 'CONSTRAINED OF RECORD C : INTEGER; -- FOR 'SIZE OF RECORD D : ADDRESS; -- FOR 'ADDRESS OF TASK E : BIG_INT; -- FOR 'STORAGE_SIZE OF TASK BEGIN P_TASK_OBJECT := NEW TASK_TYPE; A := F.ALL'ADDRESS; B := F.ALL'CONSTRAINED; C := F.ALL'SIZE; D := G.ALL'ADDRESS; E := G.ALL'STORAGE_SIZE; IF A /= P_REC_OBJECT.ALL'ADDRESS THEN FAILED("INCORRECT RESOLUTION FOR 'ADDRESS - REC"); END IF; IF B /= P_REC_OBJECT.ALL'CONSTRAINED THEN FAILED("INCORRECT RESOLUTION FOR 'CONSTRAINED"); END IF; IF C /= P_REC_OBJECT.ALL'SIZE THEN FAILED("INCORRECT RESOLUTION FOR 'SIZE"); END IF; IF D /= P_TASK_OBJECT.ALL'ADDRESS THEN FAILED("INCORRECT RESOLUTION FOR 'ADDRESS - TASK"); END IF; IF E /= P_TASK_OBJECT.ALL'STORAGE_SIZE THEN FAILED("INCORRECT RESOLUTION FOR 'STORAGE_SIZE"); END IF; IF A = P_REC_OBJECT'ADDRESS THEN FAILED("INCORRECT DEREFERENCING FOR 'ADDRESS - REC"); END IF; IF C = P_REC_OBJECT'SIZE AND C /= P_REC_OBJECT.ALL'SIZE THEN FAILED("INCORRECT DEREFERENCING FOR 'SIZE"); END IF; IF D = P_TASK_OBJECT'ADDRESS THEN FAILED("INCORRECT DEREFERENCING FOR 'ADDRESS - TASK"); END IF; END; RESULT; END C87B26B;

30.053333

79

0.576974

8b2cb5eccbab4c8e67f8be221fe3832752fcf4d0

18,191

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/par-labl.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/par-labl.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/par-labl.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . L A B L -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2013, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ separate (Par) procedure Labl is Enclosing_Body_Or_Block : Node_Id; -- Innermost enclosing body or block statement Label_Decl_Node : Node_Id; -- Implicit label declaration node Defining_Ident_Node : Node_Id; -- Defining identifier node for implicit label declaration Next_Label_Elmt : Elmt_Id; -- Next element on label element list Label_Node : Node_Id; -- Next label node to process function Find_Enclosing_Body_Or_Block (N : Node_Id) return Node_Id; -- Find the innermost body or block that encloses N function Find_Enclosing_Body (N : Node_Id) return Node_Id; -- Find the innermost body that encloses N procedure Check_Distinct_Labels; -- Checks the rule in RM-5.1(11), which requires distinct identifiers -- for all the labels in a given body. procedure Find_Natural_Loops; -- Recognizes loops created by backward gotos, and rewrites the -- corresponding statements into a proper loop, for optimization -- purposes (for example, to control reclaiming local storage). --------------------------- -- Check_Distinct_Labels -- --------------------------- procedure Check_Distinct_Labels is Label_Id : constant Node_Id := Identifier (Label_Node); Enclosing_Body : constant Node_Id := Find_Enclosing_Body (Enclosing_Body_Or_Block); -- Innermost enclosing body Next_Other_Label_Elmt : Elmt_Id := First_Elmt (Label_List); -- Next element on label element list Other_Label : Node_Id; -- Next label node to process begin -- Loop through all the labels, and if we find some other label -- (i.e. not Label_Node) that has the same identifier, -- and whose innermost enclosing body is the same, -- then we have an error. -- Note that in the worst case, this is quadratic in the number -- of labels. However, labels are not all that common, and this -- is only called for explicit labels. -- ???Nonetheless, the efficiency could be improved. For example, -- call Labl for each body, rather than once per compilation. while Present (Next_Other_Label_Elmt) loop Other_Label := Node (Next_Other_Label_Elmt); exit when Label_Node = Other_Label; if Chars (Label_Id) = Chars (Identifier (Other_Label)) and then Enclosing_Body = Find_Enclosing_Body (Other_Label) then Error_Msg_Sloc := Sloc (Other_Label); Error_Msg_N ("& conflicts with label#", Label_Id); exit; end if; Next_Elmt (Next_Other_Label_Elmt); end loop; end Check_Distinct_Labels; ------------------------- -- Find_Enclosing_Body -- ------------------------- function Find_Enclosing_Body (N : Node_Id) return Node_Id is Result : Node_Id := N; begin -- This is the same as Find_Enclosing_Body_Or_Block, except -- that we skip block statements and accept statements, instead -- of stopping at them. while Present (Result) and then Nkind (Result) /= N_Entry_Body and then Nkind (Result) /= N_Task_Body and then Nkind (Result) /= N_Package_Body and then Nkind (Result) /= N_Subprogram_Body loop Result := Parent (Result); end loop; return Result; end Find_Enclosing_Body; ---------------------------------- -- Find_Enclosing_Body_Or_Block -- ---------------------------------- function Find_Enclosing_Body_Or_Block (N : Node_Id) return Node_Id is Result : Node_Id := Parent (N); begin -- Climb up the parent chain until we find a body or block while Present (Result) and then Nkind (Result) /= N_Accept_Statement and then Nkind (Result) /= N_Entry_Body and then Nkind (Result) /= N_Task_Body and then Nkind (Result) /= N_Package_Body and then Nkind (Result) /= N_Subprogram_Body and then Nkind (Result) /= N_Block_Statement loop Result := Parent (Result); end loop; return Result; end Find_Enclosing_Body_Or_Block; ------------------------ -- Find_Natural_Loops -- ------------------------ procedure Find_Natural_Loops is Node_List : constant Elist_Id := New_Elmt_List; N : Elmt_Id; Succ : Elmt_Id; function Goto_Id (Goto_Node : Node_Id) return Name_Id; -- Find Name_Id of goto statement, which may be an expanded name function Matches (Label_Node : Node_Id; Goto_Node : Node_Id) return Boolean; -- A label and a goto are candidates for a loop if the names match, -- and both nodes appear in the same body. In addition, both must -- appear in the same statement list. If they are not in the same -- statement list, the goto is from within an nested structure, and -- the label is not a header. We ignore the case where the goto is -- within a conditional structure, and capture only infinite loops. procedure Merge; -- Merge labels and goto statements in order of increasing sloc value. -- Discard labels of loop and block statements. procedure No_Header (N : Elmt_Id); -- The label N is known not to be a loop header. Scan forward and -- remove all subsequent gotos that may have this node as a target. procedure Process_Goto (N : Elmt_Id); -- N is a forward jump. Scan forward and remove all subsequent gotos -- that may have the same target, to preclude spurious loops. procedure Rewrite_As_Loop (Loop_Header : Node_Id; Loop_End : Node_Id); -- Given a label and a backwards goto, rewrite intervening statements -- as a loop. Remove the label from the node list, and rewrite the -- goto with the body of the new loop. procedure Try_Loop (N : Elmt_Id); -- N is a label that may be a loop header. Scan forward to find some -- backwards goto with which to make a loop. Do nothing if there is -- an intervening label that is not part of a loop, or more than one -- goto with this target. ------------- -- Goto_Id -- ------------- function Goto_Id (Goto_Node : Node_Id) return Name_Id is begin if Nkind (Name (Goto_Node)) = N_Identifier then return Chars (Name (Goto_Node)); elsif Nkind (Name (Goto_Node)) = N_Selected_Component then return Chars (Selector_Name (Name (Goto_Node))); else -- In case of error, return Id that can't match anything return Name_Null; end if; end Goto_Id; ------------- -- Matches -- ------------- function Matches (Label_Node : Node_Id; Goto_Node : Node_Id) return Boolean is begin return Chars (Identifier (Label_Node)) = Goto_Id (Goto_Node) and then Find_Enclosing_Body (Label_Node) = Find_Enclosing_Body (Goto_Node); end Matches; ----------- -- Merge -- ----------- procedure Merge is L1 : Elmt_Id; G1 : Elmt_Id; begin L1 := First_Elmt (Label_List); G1 := First_Elmt (Goto_List); while Present (L1) and then Present (G1) loop if Sloc (Node (L1)) < Sloc (Node (G1)) then -- Optimization: remove labels of loops and blocks, which -- play no role in what follows. if Nkind (Node (L1)) /= N_Loop_Statement and then Nkind (Node (L1)) /= N_Block_Statement then Append_Elmt (Node (L1), Node_List); end if; Next_Elmt (L1); else Append_Elmt (Node (G1), Node_List); Next_Elmt (G1); end if; end loop; while Present (L1) loop Append_Elmt (Node (L1), Node_List); Next_Elmt (L1); end loop; while Present (G1) loop Append_Elmt (Node (G1), Node_List); Next_Elmt (G1); end loop; end Merge; --------------- -- No_Header -- --------------- procedure No_Header (N : Elmt_Id) is S1, S2 : Elmt_Id; begin S1 := Next_Elmt (N); while Present (S1) loop S2 := Next_Elmt (S1); if Nkind (Node (S1)) = N_Goto_Statement and then Matches (Node (N), Node (S1)) then Remove_Elmt (Node_List, S1); end if; S1 := S2; end loop; end No_Header; ------------------ -- Process_Goto -- ------------------ procedure Process_Goto (N : Elmt_Id) is Goto1 : constant Node_Id := Node (N); Goto2 : Node_Id; S, S1 : Elmt_Id; begin S := Next_Elmt (N); while Present (S) loop S1 := Next_Elmt (S); Goto2 := Node (S); if Nkind (Goto2) = N_Goto_Statement and then Goto_Id (Goto1) = Goto_Id (Goto2) and then Find_Enclosing_Body (Goto1) = Find_Enclosing_Body (Goto2) then -- Goto2 may have the same target, remove it from -- consideration. Remove_Elmt (Node_List, S); end if; S := S1; end loop; end Process_Goto; --------------------- -- Rewrite_As_Loop -- --------------------- procedure Rewrite_As_Loop (Loop_Header : Node_Id; Loop_End : Node_Id) is Loop_Body : constant List_Id := New_List; Loop_Stmt : constant Node_Id := New_Node (N_Loop_Statement, Sloc (Loop_Header)); Stat : Node_Id; Next_Stat : Node_Id; begin Stat := Next (Loop_Header); while Stat /= Loop_End loop Next_Stat := Next (Stat); Remove (Stat); Append (Stat, Loop_Body); Stat := Next_Stat; end loop; Set_Statements (Loop_Stmt, Loop_Body); Set_Identifier (Loop_Stmt, Identifier (Loop_Header)); Remove (Loop_Header); Rewrite (Loop_End, Loop_Stmt); Error_Msg_N ("info: code between label and backwards goto rewritten as loop??", Loop_End); end Rewrite_As_Loop; -------------- -- Try_Loop -- -------------- procedure Try_Loop (N : Elmt_Id) is Source : Elmt_Id; Found : Boolean := False; S1 : Elmt_Id; begin S1 := Next_Elmt (N); while Present (S1) loop if Nkind (Node (S1)) = N_Goto_Statement and then Matches (Node (N), Node (S1)) then if not Found then -- If the label and the goto are both in the same statement -- list, then we've found a loop. Note that labels and goto -- statements are always part of some list, so In_Same_List -- always makes sense. if In_Same_List (Node (N), Node (S1)) then Source := S1; Found := True; -- The goto is within some nested structure else No_Header (N); return; end if; else -- More than one goto with the same target No_Header (N); return; end if; elsif Nkind (Node (S1)) = N_Label and then not Found then -- Intervening label before possible end of loop. Current -- label is not a candidate. This is conservative, because -- the label might not be the target of any jumps, but not -- worth dealing with useless labels. No_Header (N); return; else -- If the node is a loop_statement, it corresponds to a -- label-goto pair rewritten as a loop. Continue forward scan. null; end if; Next_Elmt (S1); end loop; if Found then Rewrite_As_Loop (Node (N), Node (Source)); Remove_Elmt (Node_List, N); Remove_Elmt (Node_List, Source); end if; end Try_Loop; begin -- Start of processing for Find_Natural_Loops Merge; N := First_Elmt (Node_List); while Present (N) loop Succ := Next_Elmt (N); if Nkind (Node (N)) = N_Label then if No (Succ) then exit; elsif Nkind (Node (Succ)) = N_Label then Try_Loop (Succ); -- If a loop was found, the label has been removed, and -- the following goto rewritten as the loop body. Succ := Next_Elmt (N); if Nkind (Node (Succ)) = N_Label then -- Following label was not removed, so current label -- is not a candidate header. No_Header (N); else -- Following label was part of inner loop. Current -- label is still a candidate. Try_Loop (N); Succ := Next_Elmt (N); end if; elsif Nkind (Node (Succ)) = N_Goto_Statement then Try_Loop (N); Succ := Next_Elmt (N); end if; elsif Nkind (Node (N)) = N_Goto_Statement then Process_Goto (N); Succ := Next_Elmt (N); end if; N := Succ; end loop; end Find_Natural_Loops; -- Start of processing for Par.Labl begin Next_Label_Elmt := First_Elmt (Label_List); while Present (Next_Label_Elmt) loop Label_Node := Node (Next_Label_Elmt); if not Comes_From_Source (Label_Node) then goto Next_Label; end if; -- Find the innermost enclosing body or block, which is where -- we need to implicitly declare this label Enclosing_Body_Or_Block := Find_Enclosing_Body_Or_Block (Label_Node); -- If we didn't find a parent, then the label in question never got -- hooked into a reasonable declarative part. This happens only in -- error situations, and we simply ignore the entry (we aren't going -- to get into the semantics in any case given the error). if Present (Enclosing_Body_Or_Block) then Check_Distinct_Labels; -- Now create the implicit label declaration node and its -- corresponding defining identifier. Note that the defining -- occurrence of a label is the implicit label declaration that -- we are creating. The label itself is an applied occurrence. Label_Decl_Node := New_Node (N_Implicit_Label_Declaration, Sloc (Label_Node)); Defining_Ident_Node := New_Entity (N_Defining_Identifier, Sloc (Identifier (Label_Node))); Set_Chars (Defining_Ident_Node, Chars (Identifier (Label_Node))); Set_Defining_Identifier (Label_Decl_Node, Defining_Ident_Node); Set_Label_Construct (Label_Decl_Node, Label_Node); -- The following makes sure that Comes_From_Source is appropriately -- set for the entity, depending on whether the label appeared in -- the source explicitly or not. Set_Comes_From_Source (Defining_Ident_Node, Comes_From_Source (Identifier (Label_Node))); -- Now attach the implicit label declaration to the appropriate -- declarative region, creating a declaration list if none exists if No (Declarations (Enclosing_Body_Or_Block)) then Set_Declarations (Enclosing_Body_Or_Block, New_List); end if; Append (Label_Decl_Node, Declarations (Enclosing_Body_Or_Block)); end if; <<Next_Label>> Next_Elmt (Next_Label_Elmt); end loop; Find_Natural_Loops; end Labl;

33.439338

78

0.542851

1eb267422522d17fbd6e1bceba09beb1528b1b4c

5,873

ads

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbprqu.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbprqu.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbprqu.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.BOUNDED_PRIORITY_QUEUES -- -- -- -- S p e c -- -- -- -- Copyright (C) 2011-2019, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with System; with Ada.Containers.Synchronized_Queue_Interfaces; with Ada.Containers.Bounded_Doubly_Linked_Lists; generic with package Queue_Interfaces is new Ada.Containers.Synchronized_Queue_Interfaces (<>); type Queue_Priority is private; with function Get_Priority (Element : Queue_Interfaces.Element_Type) return Queue_Priority is <>; with function Before (Left, Right : Queue_Priority) return Boolean is <>; Default_Capacity : Count_Type; Default_Ceiling : System.Any_Priority := System.Priority'Last; package Ada.Containers.Bounded_Priority_Queues is pragma Annotate (CodePeer, Skip_Analysis); pragma Preelaborate; package Implementation is -- All identifiers in this unit are implementation defined pragma Implementation_Defined; type List_Type (Capacity : Count_Type) is tagged limited private; procedure Enqueue (List : in out List_Type; New_Item : Queue_Interfaces.Element_Type); procedure Dequeue (List : in out List_Type; Element : out Queue_Interfaces.Element_Type); procedure Dequeue (List : in out List_Type; At_Least : Queue_Priority; Element : in out Queue_Interfaces.Element_Type; Success : out Boolean); function First_Element (List : List_Type) return Queue_Interfaces.Element_Type; function Length (List : List_Type) return Count_Type; function Max_Length (List : List_Type) return Count_Type; private -- We need a better data structure here, such as a proper heap. ??? pragma Warnings (Off); -- Otherwise, we get warnings for the uninitialized variable in Insert -- in Ada.Containers.Bounded_Doubly_Linked_Lists. package List_Types is new Bounded_Doubly_Linked_Lists (Element_Type => Queue_Interfaces.Element_Type, "=" => Queue_Interfaces."="); pragma Warnings (On); type List_Type (Capacity : Count_Type) is tagged limited record Container : List_Types.List (Capacity); Max_Length : Count_Type := 0; end record; end Implementation; protected type Queue (Capacity : Count_Type := Default_Capacity; Ceiling : System.Any_Priority := Default_Ceiling) with Priority => Ceiling is new Queue_Interfaces.Queue with overriding entry Enqueue (New_Item : Queue_Interfaces.Element_Type); overriding entry Dequeue (Element : out Queue_Interfaces.Element_Type); -- The priority queue operation Dequeue_Only_High_Priority had been a -- protected entry in early drafts of AI05-0159, but it was discovered -- that that operation as specified was not in fact implementable. The -- operation was changed from an entry to a protected procedure per the -- ARG meeting in Edinburgh (June 2011), with a different signature and -- semantics. procedure Dequeue_Only_High_Priority (At_Least : Queue_Priority; Element : in out Queue_Interfaces.Element_Type; Success : out Boolean); overriding function Current_Use return Count_Type; overriding function Peak_Use return Count_Type; private List : Implementation.List_Type (Capacity); end Queue; end Ada.Containers.Bounded_Priority_Queues;

42.557971

78

0.569215

1ebe13bed77de1981e3d2779afce7002a6a992ab

6,376

adb

Ada

testsuite/tests/wire_simulation/src/tc_virtual_wire.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

testsuite/tests/wire_simulation/src/tc_virtual_wire.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

testsuite/tests/wire_simulation/src/tc_virtual_wire.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2017-2018, AdaCore -- -- -- -- 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 the copyright holder 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. -- -- -- ------------------------------------------------------------------------------ with HAL.GPIO; use HAL.GPIO; with Wire_Simulation; use Wire_Simulation; with Ada.Text_IO; use Ada.Text_IO; procedure TC_Virtual_Wire is pragma Assertion_Policy (Assert => Check); No_Pull_Wire : Virtual_Wire (Default_Pull => Floating, Max_Points => 2); Pull_Up_Wire : Virtual_Wire (Default_Pull => Pull_Up, Max_Points => 2); Pull_Down_Wire : Virtual_Wire (Default_Pull => Pull_Down, Max_Points => 2); Unref : Boolean with Unreferenced; begin -- Default mode -- pragma Assert (No_Pull_Wire.Point (1).Mode = Input, "Default point mode should be input"); -- State with only inputs and a wire pull resistor -- pragma Assert (Pull_Up_Wire.Point (1).Set, "Default state of pull up wire should be high"); pragma Assert (not Pull_Down_Wire.Point (1).Set, "Default state of pull down wire should be low"); -- State with only inputs and a point pull resistor -- pragma Assert (No_Pull_Wire.Point (1).Support (Pull_Up), "It should be possible to change the pull resitor"); No_Pull_Wire.Point (1).Set_Pull_Resistor (Pull_Up); pragma Assert (No_Pull_Wire.Point (1).Set, "State of wire with one pull up point should be high"); No_Pull_Wire.Point (1).Set_Pull_Resistor (Pull_Down); pragma Assert (not No_Pull_Wire.Point (1).Set, "State of wire with one pull down point should be low"); -- State with one input one output and no pull resistor -- pragma Assert (No_Pull_Wire.Point (1).Support (Input), "It should be possible to change the mode"); No_Pull_Wire.Point (1).Set_Mode (Input); No_Pull_Wire.Point (1).Set_Pull_Resistor (Pull_Down); No_Pull_Wire.Point (2).Set_Mode (Output); No_Pull_Wire.Point (2).Set_Pull_Resistor (Floating); No_Pull_Wire.Point (2).Set; pragma Assert (No_Pull_Wire.Point (1).Set, "Should be high"); No_Pull_Wire.Point (2).Clear; pragma Assert (not No_Pull_Wire.Point (1).Set, "Should be low"); -- State with one input one output and point pull resistor -- No_Pull_Wire.Point (1).Set_Mode (Input); No_Pull_Wire.Point (1).Set_Pull_Resistor (Pull_Up); No_Pull_Wire.Point (2).Set_Mode (Output); No_Pull_Wire.Point (2).Set_Pull_Resistor (Floating); No_Pull_Wire.Point (2).Set; pragma Assert (No_Pull_Wire.Point (1).Set, "Should be high"); No_Pull_Wire.Point (2).Clear; pragma Assert (not No_Pull_Wire.Point (1).Set, "Should be low"); No_Pull_Wire.Point (1).Set_Pull_Resistor (Pull_Down); No_Pull_Wire.Point (2).Set; pragma Assert (No_Pull_Wire.Point (1).Set, "Should be high"); No_Pull_Wire.Point (2).Clear; pragma Assert (not No_Pull_Wire.Point (1).Set, "Should be low"); -- Opposite pull on the same wire -- declare begin Pull_Down_Wire.Point (1).Set_Pull_Resistor (Pull_Up); exception when Invalid_Configuration => Put_Line ("Expected exception on oppposite pull (1)"); end; declare begin Pull_Up_Wire.Point (1).Set_Pull_Resistor (Pull_Down); exception when Invalid_Configuration => Put_Line ("Expected exception on oppposite pull (2)"); end; -- Two output point on a wire -- declare begin Pull_Up_Wire.Point (1).Set_Mode (Output); Pull_Up_Wire.Point (2).Set_Mode (Output); exception when Invalid_Configuration => Put_Line ("Expected exception on multiple output points"); end; -- Unknon state -- declare begin No_Pull_Wire.Point (1).Set_Mode (Input); No_Pull_Wire.Point (1).Set_Pull_Resistor (Floating); No_Pull_Wire.Point (2).Set_Mode (Input); No_Pull_Wire.Point (2).Set_Pull_Resistor (Floating); Unref := No_Pull_Wire.Point (2).Set; exception when Unknown_State => Put_Line ("Expected exception on unknown state"); end; end TC_Virtual_Wire;

41.402597

78

0.601317

044f748fb6a81acf1f81660110852d037bd66f90

18,349

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-ngcoty.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-ngcoty.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-ngcoty.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . N U M E R I C S . G E N E R I C _ C O M P L E X _ T Y P E S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Numerics.Aux; use Ada.Numerics.Aux; package body Ada.Numerics.Generic_Complex_Types is subtype R is Real'Base; Two_Pi : constant R := R (2.0) * Pi; Half_Pi : constant R := Pi / R (2.0); --------- -- "*" -- --------- function "*" (Left, Right : Complex) return Complex is X : R; Y : R; begin X := Left.Re * Right.Re - Left.Im * Right.Im; Y := Left.Re * Right.Im + Left.Im * Right.Re; -- If either component overflows, try to scale if abs (X) > R'Last then X := R'(4.0) * (R'(Left.Re / 2.0) * R'(Right.Re / 2.0) - R'(Left.Im / 2.0) * R'(Right.Im / 2.0)); end if; if abs (Y) > R'Last then Y := R'(4.0) * (R'(Left.Re / 2.0) * R'(Right.Im / 2.0) - R'(Left.Im / 2.0) * R'(Right.Re / 2.0)); end if; return (X, Y); end "*"; function "*" (Left, Right : Imaginary) return Real'Base is begin return -R (Left) * R (Right); end "*"; function "*" (Left : Complex; Right : Real'Base) return Complex is begin return Complex'(Left.Re * Right, Left.Im * Right); end "*"; function "*" (Left : Real'Base; Right : Complex) return Complex is begin return (Left * Right.Re, Left * Right.Im); end "*"; function "*" (Left : Complex; Right : Imaginary) return Complex is begin return Complex'(-(Left.Im * R (Right)), Left.Re * R (Right)); end "*"; function "*" (Left : Imaginary; Right : Complex) return Complex is begin return Complex'(-(R (Left) * Right.Im), R (Left) * Right.Re); end "*"; function "*" (Left : Imaginary; Right : Real'Base) return Imaginary is begin return Left * Imaginary (Right); end "*"; function "*" (Left : Real'Base; Right : Imaginary) return Imaginary is begin return Imaginary (Left * R (Right)); end "*"; ---------- -- "**" -- ---------- function "**" (Left : Complex; Right : Integer) return Complex is Result : Complex := (1.0, 0.0); Factor : Complex := Left; Exp : Integer := Right; begin -- We use the standard logarithmic approach, Exp gets shifted right -- testing successive low order bits and Factor is the value of the -- base raised to the next power of 2. For positive exponents we -- multiply the result by this factor, for negative exponents, we -- divide by this factor. if Exp >= 0 then -- For a positive exponent, if we get a constraint error during -- this loop, it is an overflow, and the constraint error will -- simply be passed on to the caller. while Exp /= 0 loop if Exp rem 2 /= 0 then Result := Result * Factor; end if; Factor := Factor * Factor; Exp := Exp / 2; end loop; return Result; else -- Exp < 0 then -- For the negative exponent case, a constraint error during this -- calculation happens if Factor gets too large, and the proper -- response is to return 0.0, since what we essentially have is -- 1.0 / infinity, and the closest model number will be zero. begin while Exp /= 0 loop if Exp rem 2 /= 0 then Result := Result * Factor; end if; Factor := Factor * Factor; Exp := Exp / 2; end loop; return R'(1.0) / Result; exception when Constraint_Error => return (0.0, 0.0); end; end if; end "**"; function "**" (Left : Imaginary; Right : Integer) return Complex is M : constant R := R (Left) ** Right; begin case Right mod 4 is when 0 => return (M, 0.0); when 1 => return (0.0, M); when 2 => return (-M, 0.0); when 3 => return (0.0, -M); when others => raise Program_Error; end case; end "**"; --------- -- "+" -- --------- function "+" (Right : Complex) return Complex is begin return Right; end "+"; function "+" (Left, Right : Complex) return Complex is begin return Complex'(Left.Re + Right.Re, Left.Im + Right.Im); end "+"; function "+" (Right : Imaginary) return Imaginary is begin return Right; end "+"; function "+" (Left, Right : Imaginary) return Imaginary is begin return Imaginary (R (Left) + R (Right)); end "+"; function "+" (Left : Complex; Right : Real'Base) return Complex is begin return Complex'(Left.Re + Right, Left.Im); end "+"; function "+" (Left : Real'Base; Right : Complex) return Complex is begin return Complex'(Left + Right.Re, Right.Im); end "+"; function "+" (Left : Complex; Right : Imaginary) return Complex is begin return Complex'(Left.Re, Left.Im + R (Right)); end "+"; function "+" (Left : Imaginary; Right : Complex) return Complex is begin return Complex'(Right.Re, R (Left) + Right.Im); end "+"; function "+" (Left : Imaginary; Right : Real'Base) return Complex is begin return Complex'(Right, R (Left)); end "+"; function "+" (Left : Real'Base; Right : Imaginary) return Complex is begin return Complex'(Left, R (Right)); end "+"; --------- -- "-" -- --------- function "-" (Right : Complex) return Complex is begin return (-Right.Re, -Right.Im); end "-"; function "-" (Left, Right : Complex) return Complex is begin return (Left.Re - Right.Re, Left.Im - Right.Im); end "-"; function "-" (Right : Imaginary) return Imaginary is begin return Imaginary (-R (Right)); end "-"; function "-" (Left, Right : Imaginary) return Imaginary is begin return Imaginary (R (Left) - R (Right)); end "-"; function "-" (Left : Complex; Right : Real'Base) return Complex is begin return Complex'(Left.Re - Right, Left.Im); end "-"; function "-" (Left : Real'Base; Right : Complex) return Complex is begin return Complex'(Left - Right.Re, -Right.Im); end "-"; function "-" (Left : Complex; Right : Imaginary) return Complex is begin return Complex'(Left.Re, Left.Im - R (Right)); end "-"; function "-" (Left : Imaginary; Right : Complex) return Complex is begin return Complex'(-Right.Re, R (Left) - Right.Im); end "-"; function "-" (Left : Imaginary; Right : Real'Base) return Complex is begin return Complex'(-Right, R (Left)); end "-"; function "-" (Left : Real'Base; Right : Imaginary) return Complex is begin return Complex'(Left, -R (Right)); end "-"; --------- -- "/" -- --------- function "/" (Left, Right : Complex) return Complex is a : constant R := Left.Re; b : constant R := Left.Im; c : constant R := Right.Re; d : constant R := Right.Im; begin if c = 0.0 and then d = 0.0 then raise Constraint_Error; else return Complex'(Re => ((a * c) + (b * d)) / (c ** 2 + d ** 2), Im => ((b * c) - (a * d)) / (c ** 2 + d ** 2)); end if; end "/"; function "/" (Left, Right : Imaginary) return Real'Base is begin return R (Left) / R (Right); end "/"; function "/" (Left : Complex; Right : Real'Base) return Complex is begin return Complex'(Left.Re / Right, Left.Im / Right); end "/"; function "/" (Left : Real'Base; Right : Complex) return Complex is a : constant R := Left; c : constant R := Right.Re; d : constant R := Right.Im; begin return Complex'(Re => (a * c) / (c ** 2 + d ** 2), Im => -(a * d) / (c ** 2 + d ** 2)); end "/"; function "/" (Left : Complex; Right : Imaginary) return Complex is a : constant R := Left.Re; b : constant R := Left.Im; d : constant R := R (Right); begin return (b / d, -a / d); end "/"; function "/" (Left : Imaginary; Right : Complex) return Complex is b : constant R := R (Left); c : constant R := Right.Re; d : constant R := Right.Im; begin return (Re => b * d / (c ** 2 + d ** 2), Im => b * c / (c ** 2 + d ** 2)); end "/"; function "/" (Left : Imaginary; Right : Real'Base) return Imaginary is begin return Imaginary (R (Left) / Right); end "/"; function "/" (Left : Real'Base; Right : Imaginary) return Imaginary is begin return Imaginary (-Left / R (Right)); end "/"; --------- -- "<" -- --------- function "<" (Left, Right : Imaginary) return Boolean is begin return R (Left) < R (Right); end "<"; ---------- -- "<=" -- ---------- function "<=" (Left, Right : Imaginary) return Boolean is begin return R (Left) <= R (Right); end "<="; --------- -- ">" -- --------- function ">" (Left, Right : Imaginary) return Boolean is begin return R (Left) > R (Right); end ">"; ---------- -- ">=" -- ---------- function ">=" (Left, Right : Imaginary) return Boolean is begin return R (Left) >= R (Right); end ">="; ----------- -- "abs" -- ----------- function "abs" (Right : Imaginary) return Real'Base is begin return abs R (Right); end "abs"; -------------- -- Argument -- -------------- function Argument (X : Complex) return Real'Base is a : constant R := X.Re; b : constant R := X.Im; arg : R; begin if b = 0.0 then if a >= 0.0 then return 0.0; else return R'Copy_Sign (Pi, b); end if; elsif a = 0.0 then if b >= 0.0 then return Half_Pi; else return -Half_Pi; end if; else arg := R (Atan (Double (abs (b / a)))); if a > 0.0 then if b > 0.0 then return arg; else -- b < 0.0 return -arg; end if; else -- a < 0.0 if b >= 0.0 then return Pi - arg; else -- b < 0.0 return -(Pi - arg); end if; end if; end if; exception when Constraint_Error => if b > 0.0 then return Half_Pi; else return -Half_Pi; end if; end Argument; function Argument (X : Complex; Cycle : Real'Base) return Real'Base is begin if Cycle > 0.0 then return Argument (X) * Cycle / Two_Pi; else raise Argument_Error; end if; end Argument; ---------------------------- -- Compose_From_Cartesian -- ---------------------------- function Compose_From_Cartesian (Re, Im : Real'Base) return Complex is begin return (Re, Im); end Compose_From_Cartesian; function Compose_From_Cartesian (Re : Real'Base) return Complex is begin return (Re, 0.0); end Compose_From_Cartesian; function Compose_From_Cartesian (Im : Imaginary) return Complex is begin return (0.0, R (Im)); end Compose_From_Cartesian; ------------------------ -- Compose_From_Polar -- ------------------------ function Compose_From_Polar ( Modulus, Argument : Real'Base) return Complex is begin if Modulus = 0.0 then return (0.0, 0.0); else return (Modulus * R (Cos (Double (Argument))), Modulus * R (Sin (Double (Argument)))); end if; end Compose_From_Polar; function Compose_From_Polar ( Modulus, Argument, Cycle : Real'Base) return Complex is Arg : Real'Base; begin if Modulus = 0.0 then return (0.0, 0.0); elsif Cycle > 0.0 then if Argument = 0.0 then return (Modulus, 0.0); elsif Argument = Cycle / 4.0 then return (0.0, Modulus); elsif Argument = Cycle / 2.0 then return (-Modulus, 0.0); elsif Argument = 3.0 * Cycle / R (4.0) then return (0.0, -Modulus); else Arg := Two_Pi * Argument / Cycle; return (Modulus * R (Cos (Double (Arg))), Modulus * R (Sin (Double (Arg)))); end if; else raise Argument_Error; end if; end Compose_From_Polar; --------------- -- Conjugate -- --------------- function Conjugate (X : Complex) return Complex is begin return Complex'(X.Re, -X.Im); end Conjugate; -------- -- Im -- -------- function Im (X : Complex) return Real'Base is begin return X.Im; end Im; function Im (X : Imaginary) return Real'Base is begin return R (X); end Im; ------------- -- Modulus -- ------------- function Modulus (X : Complex) return Real'Base is Re2, Im2 : R; begin begin Re2 := X.Re ** 2; -- To compute (a**2 + b**2) ** (0.5) when a**2 may be out of bounds, -- compute a * (1 + (b/a) **2) ** (0.5). On a machine where the -- squaring does not raise constraint_error but generates infinity, -- we can use an explicit comparison to determine whether to use -- the scaling expression. -- The scaling expression is computed in double format throughout -- in order to prevent inaccuracies on machines where not all -- immediate expressions are rounded, such as PowerPC. if Re2 > R'Last then raise Constraint_Error; end if; exception when Constraint_Error => return R (Double (abs (X.Re)) * Sqrt (1.0 + (Double (X.Im) / Double (X.Re)) ** 2)); end; begin Im2 := X.Im ** 2; if Im2 > R'Last then raise Constraint_Error; end if; exception when Constraint_Error => return R (Double (abs (X.Im)) * Sqrt (1.0 + (Double (X.Re) / Double (X.Im)) ** 2)); end; -- Now deal with cases of underflow. If only one of the squares -- underflows, return the modulus of the other component. If both -- squares underflow, use scaling as above. if Re2 = 0.0 then if X.Re = 0.0 then return abs (X.Im); elsif Im2 = 0.0 then if X.Im = 0.0 then return abs (X.Re); else if abs (X.Re) > abs (X.Im) then return R (Double (abs (X.Re)) * Sqrt (1.0 + (Double (X.Im) / Double (X.Re)) ** 2)); else return R (Double (abs (X.Im)) * Sqrt (1.0 + (Double (X.Re) / Double (X.Im)) ** 2)); end if; end if; else return abs (X.Im); end if; elsif Im2 = 0.0 then return abs (X.Re); -- In all other cases, the naive computation will do else return R (Sqrt (Double (Re2 + Im2))); end if; end Modulus; -------- -- Re -- -------- function Re (X : Complex) return Real'Base is begin return X.Re; end Re; ------------ -- Set_Im -- ------------ procedure Set_Im (X : in out Complex; Im : Real'Base) is begin X.Im := Im; end Set_Im; procedure Set_Im (X : out Imaginary; Im : Real'Base) is begin X := Imaginary (Im); end Set_Im; ------------ -- Set_Re -- ------------ procedure Set_Re (X : in out Complex; Re : Real'Base) is begin X.Re := Re; end Set_Re; end Ada.Numerics.Generic_Complex_Types;

27.386567

78

0.490272

a0cbbb811716aa2647f2d0c6abd7483ba60b2920

3,704

ads

Ada

src/Utilities/xml_scanners.ads

fintatarta/eugen

2c384838ff0e81b51172310ce5d0e47d71ffd4fd

[ "MIT" ]

null

src/Utilities/xml_scanners.ads

fintatarta/eugen

2c384838ff0e81b51172310ce5d0e47d71ffd4fd

[ "MIT" ]

null

src/Utilities/xml_scanners.ads

fintatarta/eugen

2c384838ff0e81b51172310ce5d0e47d71ffd4fd

[ "MIT" ]

null

with DOM.Core; with Ada.Finalization; package XML_Scanners is -- -- As well knnown, an XML document is a tree. An XML_Scanner is -- an object associated to a tree of the node that allows to -- iterate over the node children. At every time there is a -- "current child." The function Scan returns the current child -- and "consumes" it. -- type XML_Scanner (<>) is new Ada.Finalization.Limited_Controlled with private; function Create_Child_Scanner (Parent : DOM.Core.Node) return XML_Scanner; -- Return true if all the children have been used function No_More_Children (Scanner : XML_Scanner) return Boolean; -- Return the number of children still to be used function Remaining_Children (Scanner : XML_Scanner) return Natural; -- Return the current node, but do not consume it function Peek_Node (Scanner : XML_Scanner) return DOM.Core.Node; -- Raise Unexpected_Node unless the current node has the given name. -- Do not consume the node. procedure Expect (Scanner : XML_Scanner; Name : String); -- Raise Unexpected_Node unless all the children have been used. procedure Expect_End_Of_Children (Scanner : XML_Scanner); -- -- Expect that current node has the specified name and it is a -- "pure text" node, that is, a node whose only children is text. -- If everything is OK, it consumes the node and returns the node content, -- otherwise raises Unexpected_Node. -- function Parse_Text_Node (Scanner : XML_Scanner; Name : String) return String; No_Limit : constant Natural; -- -- Expect a sequence of nodes with the given name. For every node -- calls the given callback. Unexpected_Node is raised if the -- number of nodes is not within the specified limits -- procedure Parse_Sequence (Scanner : in out XML_Scanner; Name : in String; Callback : not null access procedure (N : DOM.Core.Node); Min_Length : in Natural := 1; Max_Length : in Natural := No_Limit); -- Like Parse_Sequence with min=0, max=1 procedure Parse_Optional (Scanner : in out XML_Scanner; Name : in String; Callback : not null access procedure (N : DOM.Core.Node)); -- Like Parse_Sequence with min=max=1 procedure Parse_Single_Node (Scanner : in out XML_Scanner; Name : in String; Callback : not null access procedure (N : DOM.Core.Node)); No_Name : constant String; function Peek_Name (Scanner : XML_Scanner) return String; function Scan (Scanner : XML_Scanner) return DOM.Core.Node; Unexpected_Node : exception; type Abstract_Node_Processor is interface; procedure Process (Processor : in out Abstract_Node_Processor; Node : in DOM.Core.Node) is abstract; procedure Process_Sequence (Scanner : in out XML_Scanner; Name : in String; Processor : in out Abstract_Node_Processor'Class; Min_Length : in Natural := 1; Max_Length : in Natural := No_Limit); private No_Name : constant String := ""; No_Limit : constant Natural := Natural'Last; type XML_Scanner_Data is record Nodes : DOM.Core.Node_List; Cursor : Natural; end record; type XML_Scanner_Data_Access is access XML_Scanner_Data; type XML_Scanner is new Ada.Finalization.Limited_Controlled with record Acc : XML_Scanner_Data_Access; end record; overriding procedure Finalize (Object : in out XML_Scanner); end XML_Scanners;

31.65812

77

0.659017

38a00637d0b6df4fe5ca4d84eee7e1fbf80554c0

67,214

adb

Ada

src/asis/asis-compilation_units.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

15

2015-01-18T23:04:19.000Z

2022-03-01T20:27:08.000Z

src/asis/asis-compilation_units.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

16

2018-06-10T07:09:30.000Z

2022-03-26T18:28:40.000Z

src/asis/asis-compilation_units.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

3

2015-11-11T18:00:14.000Z

2022-01-30T23:08:45.000Z

------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . C O M P I L A T I O N _ U N I T S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-2009, Free Software Foundation, Inc. -- -- -- -- ASIS-for-GNAT is free software; you can redistribute it and/or modify it -- -- under terms of the GNU General Public License as published by the Free -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General -- -- Public License for more details. You should have received a copy of the -- -- GNU General Public License distributed with ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ with Ada.Characters.Handling; use Ada.Characters.Handling; with Asis.Errors; use Asis.Errors; with Asis.Exceptions; use Asis.Exceptions; with Asis.Extensions; use Asis.Extensions; with Asis.Implementation; use Asis.Implementation; with Asis.Set_Get; use Asis.Set_Get; with A4G.A_Opt; use A4G.A_Opt; with A4G.A_Output; use A4G.A_Output; with A4G.Vcheck; use A4G.Vcheck; with A4G.Get_Unit; use A4G.Get_Unit; with A4G.Contt; use A4G.Contt; with A4G.Contt.UT; use A4G.Contt.UT; with Lib; use Lib; package body Asis.Compilation_Units is Package_Name : constant String := "Asis.Compilation_Units."; LT : Wide_String renames A4G.A_Types.Asis_Wide_Line_Terminator; function "=" (Left, Right : Compilation_Unit) return Boolean renames Asis.Set_Get."="; ---------------------- -- Attribute_Values -- ---------------------- function Attribute_Values (Compilation_Unit : Asis.Compilation_Unit; Attribute : Wide_String) return Wide_String is begin pragma Unreferenced (Attribute); Check_Validity (Compilation_Unit, Package_Name & "Attribute_Values"); return Nil_Asis_Wide_String; end Attribute_Values; ------------------------------- -- Attribute_Value_Delimiter -- ------------------------------- function Attribute_Value_Delimiter return Wide_String is begin return Asis_Wide_Line_Terminator; end Attribute_Value_Delimiter; ------------------------- -- Can_Be_Main_Program -- ------------------------- function Can_Be_Main_Program (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Result : Boolean := False; begin Check_Validity (Compilation_Unit, Package_Name & "Can_Be_Main_Program"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); case Kind (Compilation_Unit) is when A_Procedure | A_Function | A_Procedure_Body | A_Function_Body | A_Procedure_Renaming | A_Function_Renaming | A_Procedure_Instance | A_Function_Instance => Result := Is_Main_Unit (Compilation_Unit); when others => null; end case; return Result; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Can_Be_Main_Program"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Can_Be_Main_Program", Ex => Ex, Arg_CU => Compilation_Unit); end Can_Be_Main_Program; -------------------------------------- -- Compilation_Command_Line_Options -- -------------------------------------- function Compilation_Command_Line_Options (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Arg_Len : Natural := 0; -- total length of compilation switches Arg_Count : Nat := 0; -- total number of compilation switches Arg_Ptr : String_Ptr; Corr_Main_Unit_Id : Unit_Id := Nil_Unit; Corresponding_Main_Unit : Asis.Compilation_Unit := Nil_Compilation_Unit; begin Check_Validity (Compilation_Unit, Package_Name & "Compilation_Command_Line_Options"); Arg_Kind := Kind (Compilation_Unit); if Arg_Kind not in A_Procedure .. A_Protected_Body_Subunit then return Nil_Asis_Wide_String; end if; Arg_Cont_Id := Encl_Cont_Id (Compilation_Unit); Reset_Context (Arg_Cont_Id); if Is_Main_Unit_In_Tree (Compilation_Unit) then Corresponding_Main_Unit := Compilation_Unit; else Arg_Unit_Id := Get_Unit_Id (Compilation_Unit); -- Here we have to check if the argument unit should to -- inherit command line options from some main unit: if Arg_Kind in A_Procedure .. A_Package then -- Here we have to check if the corresponding body is a -- main unit of some compilation: Corr_Main_Unit_Id := Get_Body (Arg_Cont_Id, Arg_Unit_Id); elsif Arg_Kind in A_Procedure_Body_Subunit .. A_Protected_Body_Subunit then -- We have to go to ancestor body and to check if it is a main -- unit of some compilation Corr_Main_Unit_Id := Get_Subunit_Parent_Body (Arg_Cont_Id, Arg_Unit_Id); while Class (Arg_Cont_Id, Corr_Main_Unit_Id) = A_Separate_Body loop Corr_Main_Unit_Id := Get_Subunit_Parent_Body (Arg_Cont_Id, Corr_Main_Unit_Id); end loop; end if; Corresponding_Main_Unit := Get_Comp_Unit (Corr_Main_Unit_Id, Arg_Cont_Id); if not Is_Main_Unit_In_Tree (Corresponding_Main_Unit) then Corresponding_Main_Unit := Nil_Compilation_Unit; end if; end if; if Is_Nil (Corresponding_Main_Unit) then return Nil_Asis_Wide_String; else Reset_Main_Tree (Corresponding_Main_Unit); -- First, find the length of the string to return Find_Arguments_Length : loop Arg_Ptr := Get_Compilation_Switch (Arg_Count + 1); exit Find_Arguments_Length when Arg_Ptr = null; Arg_Count := Arg_Count + 1; Arg_Len := Arg_Len + Arg_Ptr'Length + 1; end loop Find_Arguments_Length; if Arg_Count > 0 then Arg_Len := Arg_Len - 1; end if; declare Result : String (1 .. Arg_Len); Next_Pos : Natural := 1; Next_Arg_Len : Natural; begin -- Should be rewritten on the base of ASIS string buffer??? for Next_Arg in 1 .. Arg_Count loop Arg_Ptr := Get_Compilation_Switch (Next_Arg); Next_Arg_Len := Arg_Ptr'Length; Result (Next_Pos .. Next_Pos + Next_Arg_Len - 1) := Arg_Ptr.all; Next_Pos := Next_Pos + Next_Arg_Len; if Next_Arg < Arg_Count then Result (Next_Pos) := ' '; Next_Pos := Next_Pos + 1; end if; end loop; return To_Program_Text (Result); end; end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Command_Line_Options"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Command_Line_Options", Ex => Ex, Arg_CU => Compilation_Unit); end Compilation_Command_Line_Options; ----------------------- -- Compilation_Units -- ----------------------- function Compilation_Units (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Compilation_Units"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Compilation_Units can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Lib_Unit_Decls (Res_Cont_Id) + Comp_Unit_Bodies (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); begin -- We have to skip A_Configuration_Compilation unit, it is the second -- unit in the table Result (1) := Get_Comp_Unit (Standard_Id, Res_Cont_Id); for I in 2 .. Result_Len loop Result (I) := Get_Comp_Unit (First_Unit_Id + Unit_Id (I), Res_Cont_Id); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Units"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Units", Ex => Ex); end Compilation_Units; ----------------------------- -- Compilation_Unit_Bodies -- ----------------------------- function Compilation_Unit_Bodies (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Compilation_Unit_Bodies"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Compilation_Unit_Bodies can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Comp_Unit_Bodies (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); L_U_Body : Unit_Id := First_Body; begin for I in 1 .. Result_Len loop Result (I) := Get_Comp_Unit (L_U_Body, Res_Cont_Id); L_U_Body := Next_Body (L_U_Body); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Unit_Bodies"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Unit_Bodies", Ex => Ex); end Compilation_Unit_Bodies; --------------------------- -- Compilation_Unit_Body -- --------------------------- function Compilation_Unit_Body (Name : Wide_String; The_Context : Asis.Context) return Asis.Compilation_Unit is Result_Id : Unit_Id; Result_Cont : Context_Id; begin Check_Validity (The_Context, Package_Name & "Compilation_Unit_Body"); Result_Cont := Get_Cont_Id (The_Context); Reset_Context (Result_Cont); Result_Id := Get_One_Unit (Name, Result_Cont, Spec => False); return Get_Comp_Unit (Result_Id, Result_Cont); exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Unit_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Unit_Body (" & To_String (Name) & ")", Ex => Ex); end Compilation_Unit_Body; ------------------------ -- Corresponding_Body -- ------------------------ function Corresponding_Body (Library_Item : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (Library_Item, Package_Name & "Corresponding_Body"); Result_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Body"); end if; if Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body then return Library_Item; end if; if (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package) and then not Asis.Set_Get.Is_Body_Required (Library_Item) then return Nil_Compilation_Unit; end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Cont_Tree_Mode := Tree_Processing_Mode (Result_Cont_Id); Result_Unit_Id := Get_Body (Result_Cont_Id, Arg_Unit_Id); if No (Result_Unit_Id) and then (Cont_Tree_Mode = On_The_Fly or else Cont_Tree_Mode = Mixed or else Cont_Tree_Mode = Incremental) then -- as a last escape, we try to create the result body by -- compiling on the fly: Result_Unit_Id := Get_One_Unit (Name => Unit_Full_Name (Library_Item), Context => Result_Cont_Id, Spec => False); end if; if No (Result_Unit_Id) then Result_Unit_Id := Get_Nonexistent_Unit (Result_Cont_Id); end if; return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Body", Ex => Ex, Arg_CU => Library_Item); end Corresponding_Body; function Corresponding_Body (Library_Item : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Body"); Check_Validity (Library_Item, Package_Name & "Corresponding_Body"); Arg_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Body (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Body", Ex => Ex, Arg_CU => Library_Item, Context_Par => True); end Corresponding_Body; ---------------------------- -- Corresponding_Children -- ---------------------------- function Corresponding_Children (Library_Unit : Asis.Compilation_Unit) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (Library_Unit, Package_Name & "Corresponding_Children"); Res_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Package_Instance) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Children"); end if; Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Corresponding_Children can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); declare Result_Id_List : constant Unit_Id_List := Children (Arg_Unit_Id); Result_List : constant Compilation_Unit_List := Get_Comp_Unit_List (Result_Id_List, Res_Cont_Id); begin return Result_List; end; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Children"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Children", Ex => Ex, Arg_CU => Library_Unit); end Corresponding_Children; function Corresponding_Children (Library_Unit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Corresponding_Children"); Check_Validity (Library_Unit, Package_Name & "Corresponding_Children"); Arg_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Package_Instance) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Children"); end if; Result_Cont_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode := Tree_Processing_Mode (Result_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Corresponding_Children can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Children (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit_List; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Children"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Children", Ex => Ex, Arg_CU => Library_Unit, Context_Par => True); end Corresponding_Children; ------------------------------- -- Corresponding_Declaration -- ------------------------------- function Corresponding_Declaration (Library_Item : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; begin Check_Validity (Library_Item, Package_Name & "Corresponding_Declaration"); Result_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Declaration"); end if; if Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else -- ??? Arg_Kind = A_Function_Body_Subunit or else -- ??? Arg_Kind = A_Package_Body_Subunit or else -- ??? Arg_Kind = A_Task_Body_Subunit or else -- ??? Arg_Kind = A_Protected_Body_Subunit or else -- ??? Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body -- ??? then return Library_Item; end if; if (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body) and then Class (Library_Item) = A_Public_Declaration_And_Body then return Nil_Compilation_Unit; end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Unit_Id := Get_Declaration (Result_Cont_Id, Arg_Unit_Id); return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Declaration", Ex => Ex, Arg_CU => Library_Item); end Corresponding_Declaration; function Corresponding_Declaration (Library_Item : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Declaration"); Check_Validity (Library_Item, Package_Name & "Corresponding_Declaration"); Arg_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Declaration (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Declaration", Ex => Ex, Arg_CU => Library_Item, Context_Par => True); end Corresponding_Declaration; -------------------------------------- -- Corresponding_Parent_Declaration -- -------------------------------------- function Corresponding_Parent_Declaration (Library_Unit : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; Result_Id : Unit_Id; begin Check_Validity (Library_Unit, Package_Name & "Corresponding_Parent_Declaration"); Res_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Parent_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); Result_Id := Get_Parent_Unit (Res_Cont_Id, Arg_Unit_Id); -- Result_Id cannot be Nil_Unit here return Get_Comp_Unit (Result_Id, Res_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Parent_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Parent_Declaration", Ex => Ex, Arg_CU => Library_Unit); end Corresponding_Parent_Declaration; function Corresponding_Parent_Declaration (Library_Unit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Parent_Declaration"); Check_Validity (Library_Unit, Package_Name & "Corresponding_Parent_Declaration"); Arg_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Parent_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Parent_Declaration (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Parent_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Parent_Declaration", Ex => Ex, Arg_CU => Library_Unit, Context_Par => True); end Corresponding_Parent_Declaration; --------------------------------------- -- Corresponding_Subunit_Parent_Body -- --------------------------------------- function Corresponding_Subunit_Parent_Body (Subunit : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; begin Check_Validity (Subunit, Package_Name & "Corresponding_Subunit_Parent_Body"); Result_Cont_Id := Encl_Cont_Id (Subunit); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Subunit); if not (Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Subunit); Result_Unit_Id := Get_Subunit_Parent_Body (Result_Cont_Id, Arg_Unit_Id); return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Subunit_Parent_Body", Ex => Ex, Arg_CU => Subunit); end Corresponding_Subunit_Parent_Body; function Corresponding_Subunit_Parent_Body (Subunit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Subunit_Parent_Body"); Check_Validity (Subunit, Package_Name & "Corresponding_Subunit_Parent_Body"); Arg_Cont_Id := Encl_Cont_Id (Subunit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Subunit); if not (Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Subunit); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Subunit_Parent_Body (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Subunit_Parent_Body", Ex => Ex, Arg_CU => Subunit, Context_Par => True); end Corresponding_Subunit_Parent_Body; ----------------- -- Debug_Image -- ----------------- function Debug_Image (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is LT : String renames A4G.A_Types.ASIS_Line_Terminator; begin return To_Wide_String (LT & "Compilation Unit Debug_Image: " & Debug_String (Compilation_Unit)); exception when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Debug_Image", Ex => Ex, Arg_CU => Compilation_Unit); end Debug_Image; ------------------------- -- Enclosing_Container -- ------------------------- function Enclosing_Container (Compilation_Unit : Asis.Compilation_Unit) return Asis.Ada_Environments.Containers.Container is begin Check_Validity (Compilation_Unit, Package_Name & "Enclosing_Container"); if Is_Nil (Compilation_Unit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Enclosing_Container"); else -- For the currently implemented trivial Container model we have: return Asis.Ada_Environments.Containers.Defining_Containers (Enclosing_Context (Compilation_Unit)) (1); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Enclosing_Container"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Enclosing_Container", Ex => Ex, Arg_CU => Compilation_Unit); end Enclosing_Container; ----------------------- -- Enclosing_Context -- ----------------------- function Enclosing_Context (Compilation_Unit : Asis.Compilation_Unit) return Asis.Context is begin Check_Validity (Compilation_Unit, Package_Name & "Enclosing_Context"); if Is_Nil (Compilation_Unit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Enclosing_Context"); else return Encl_Cont (Compilation_Unit); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Enclosing_Context"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Enclosing_Context", Ex => Ex, Arg_CU => Compilation_Unit); end Enclosing_Context; ------------ -- Exists -- ------------ function Exists (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Unit_Kind : Asis.Unit_Kinds; begin Check_Validity (Compilation_Unit, Package_Name & "Exists"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); Unit_Kind := Kind (Compilation_Unit); return not (Unit_Kind = Not_A_Unit or else Unit_Kind = A_Nonexistent_Declaration or else Unit_Kind = A_Nonexistent_Body); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Exists"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Exists", Ex => Ex, Arg_CU => Compilation_Unit); end Exists; ------------------- -- Has_Attribute -- ------------------- function Has_Attribute (Compilation_Unit : Asis.Compilation_Unit; Attribute : Wide_String) return Boolean is begin pragma Unreferenced (Attribute); Check_Validity (Compilation_Unit, Package_Name & "Has_Attribute"); return False; end Has_Attribute; ---------------------- -- Is_Body_Required -- ---------------------- function Is_Body_Required (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Unit_Kind : constant Asis.Unit_Kinds := Kind (Compilation_Unit); Result : Boolean := False; begin Check_Validity (Compilation_Unit, Package_Name & "Is_Body_Required"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); case Unit_Kind is when A_Package | A_Generic_Package => Result := Asis.Set_Get.Is_Body_Required (Compilation_Unit); when others => null; end case; return Result; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Body_Required"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Body_Required", Ex => Ex, Arg_CU => Compilation_Unit); end Is_Body_Required; -------------- -- Is_Equal -- -------------- function Is_Equal (Left : Asis.Compilation_Unit; Right : Asis.Compilation_Unit) return Boolean is Left_Unit_Id : Unit_Id; Right_Unit_Id : Unit_Id; Left_Cont_Id : Context_Id; Right_Cont_Id : Context_Id; begin Check_Validity (Left, Package_Name & "Is_Equal"); Check_Validity (Right, Package_Name & "Is_Equal"); Left_Unit_Id := Get_Unit_Id (Left); Right_Unit_Id := Get_Unit_Id (Right); if Left_Unit_Id = Nil_Unit and then Right_Unit_Id = Nil_Unit then return True; elsif (Right_Unit_Id = Nil_Unit and then Left_Unit_Id /= Nil_Unit) or else (Right_Unit_Id /= Nil_Unit and then Left_Unit_Id = Nil_Unit) then return False; end if; Left_Cont_Id := Encl_Cont_Id (Left); Right_Cont_Id := Encl_Cont_Id (Right); if Left_Cont_Id = Right_Cont_Id then return Left_Unit_Id = Right_Unit_Id; else return Right_Unit_Id = Get_Same_Unit (Left_Cont_Id, Left_Unit_Id, Right_Cont_Id); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Equal"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Equal", Ex => Ex, Arg_CU => Left, Arg_CU_2 => Right); end Is_Equal; ------------------ -- Is_Identical -- ------------------ function Is_Identical (Left : Asis.Compilation_Unit; Right : Asis.Compilation_Unit) return Boolean is Left_Cont_Id : Context_Id; Right_Cont_Id : Context_Id; begin Check_Validity (Left, Package_Name & "Is_Identical"); Check_Validity (Right, Package_Name & "Is_Identical"); Left_Cont_Id := Encl_Cont_Id (Left); Right_Cont_Id := Encl_Cont_Id (Right); return Left_Cont_Id = Right_Cont_Id and then Is_Equal (Left, Right); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Identical"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Identical", Ex => Ex, Arg_CU => Left, Arg_CU_2 => Right); end Is_Identical; ------------ -- Is_Nil -- ------------ function Is_Nil (Right : Asis.Compilation_Unit) return Boolean is begin Check_Validity (Right, Package_Name & "Is_Nil"); return Right = Nil_Compilation_Unit; end Is_Nil; function Is_Nil (Right : Asis.Compilation_Unit_List) return Boolean is begin return Right = Nil_Compilation_Unit_List; end Is_Nil; ------------------------------ -- Library_Unit_Declaration -- ------------------------------ function Library_Unit_Declaration (Name : Wide_String; The_Context : Asis.Context) return Asis.Compilation_Unit is Result_Id : Unit_Id; Result_Cont : Context_Id; begin Check_Validity (The_Context, Package_Name & "Library_Unit_Declaration"); Result_Cont := Get_Cont_Id (The_Context); Reset_Context (Result_Cont); Result_Id := Get_One_Unit (Name, Result_Cont, Spec => True); return Get_Comp_Unit (Result_Id, Result_Cont); exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Library_Unit_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Library_Unit_Declaration (" & To_String (Name) & ")", Ex => Ex); end Library_Unit_Declaration; ------------------------------- -- Library_Unit_Declarations -- ------------------------------- function Library_Unit_Declarations (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Library_Unit_Declarations"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Library_Unit_Declarations " & "can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Lib_Unit_Decls (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); L_U_Decl : Unit_Id := First_Unit_Id; -- Standard begin for I in 1 .. Result_Len loop Result (I) := Get_Comp_Unit (L_U_Decl, Res_Cont_Id); L_U_Decl := Next_Decl (L_U_Decl); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Library_Unit_Declarations"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Library_Unit_Declarations", Ex => Ex); end Library_Unit_Declarations; ----------------- -- Object_Form -- ----------------- function Object_Form (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Object_Form"); return Nil_Asis_Wide_String; end Object_Form; ----------------- -- Object_Name -- ----------------- function Object_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Object_Name"); return Nil_Asis_Wide_String; end Object_Name; -------------- -- Subunits -- -------------- function Subunits (Parent_Body : Asis.Compilation_Unit) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; begin Check_Validity (Parent_Body, Package_Name & "Subunits"); Res_Cont_Id := Encl_Cont_Id (Parent_Body); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Parent_Body); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Subunits"); end if; Arg_Unit_Id := Get_Unit_Id (Parent_Body); declare Result_Id_List : constant Unit_Id_List := Subunits (Res_Cont_Id, Arg_Unit_Id); Result_List : constant Compilation_Unit_List := Get_Comp_Unit_List (Result_Id_List, Res_Cont_Id); begin return Result_List; end; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Subunits"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Subunits", Ex => Ex, Arg_CU => Parent_Body); end Subunits; function Subunits (Parent_Body : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Subunits"); Check_Validity (Parent_Body, Package_Name & "Subunits"); Arg_Cont_Id := Encl_Cont_Id (Parent_Body); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Parent_Body); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Subunits"); end if; Result_Cont_Id := Get_Cont_Id (The_Context); Arg_Unit_Id := Get_Unit_Id (Parent_Body); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Subunits (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit_List; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Subunits"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Subunits", Ex => Ex, Arg_CU => Parent_Body, Context_Par => True); end Subunits; --------------- -- Text_Form -- --------------- function Text_Form (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Text_Form"); return Nil_Asis_Wide_String; end Text_Form; --------------- -- Text_Name -- --------------- function Text_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Text_Name"); if not Exists (Compilation_Unit) then return Nil_Asis_Wide_String; else -- Exists resets the Context! return To_Program_Text (Source_File (Compilation_Unit)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Text_Name"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Text_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Text_Name; ----------------- -- Unique_Name -- ----------------- function Unique_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is Arg_Kind : Unit_Kinds; begin Check_Validity (Compilation_Unit, Package_Name & "Unique_Name"); if Is_Nil (Compilation_Unit) then return Nil_Asis_Wide_String; else Reset_Context (Encl_Cont_Id (Compilation_Unit)); Arg_Kind := Unit_Kind (Compilation_Unit); -- ???!! Diagnosis_Buffer and Diagnosis_Len should not be used here! Diagnosis_Len := 0; A4G.Vcheck.Add (Context_Info (Compilation_Unit)); A4G.Vcheck.Add (": "); A4G.Vcheck.Add (Unit_Name (Compilation_Unit)); case Arg_Kind is when Asis.A_Library_Unit_Body => A4G.Vcheck.Add (" (body)"); when Asis.A_Subunit => A4G.Vcheck.Add (" (subunit)"); when others => A4G.Vcheck.Add (" (spec)"); end case; return To_Program_Text (Diagnosis_Buffer (1 .. Diagnosis_Len)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & ""); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Unique_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Unique_Name; ---------------- -- Unit_Class -- ---------------- function Unit_Class (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Classes is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Class"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); return Class (Compilation_Unit); end Unit_Class; -------------------- -- Unit_Full_Name -- -------------------- function Unit_Full_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Full_Name"); if Is_Nil (Compilation_Unit) or else Unit_Kind (Compilation_Unit) = A_Configuration_Compilation then return Nil_Asis_Wide_String; else Reset_Context (Encl_Cont_Id (Compilation_Unit)); return To_Program_Text (Unit_Name (Compilation_Unit)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Unit_Full_Name"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Unit_Full_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Unit_Full_Name; --------------- -- Unit_Kind -- --------------- function Unit_Kind (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Kinds is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Kind"); return Kind (Compilation_Unit); end Unit_Kind; ----------------- -- Unit_Origin -- ----------------- function Unit_Origin (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Origins is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Origin"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); return Origin (Compilation_Unit); end Unit_Origin; end Asis.Compilation_Units;

32.931896

79

0.575892

a063bc0fcafabd6e10c22e4e70f97a266561842c

1,255

ads

Ada

processor/processor-eagle_io_p.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

2

2021-03-26T08:25:38.000Z

2021-06-08T03:10:12.000Z

processor/processor-eagle_io_p.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

null

processor/processor-eagle_io_p.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

null

-- MIT License -- Copyright (c) 2021 Stephen Merrony -- 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. package Processor.Eagle_IO_P is procedure Do_Eagle_IO (I : in Decoded_Instr_T; CPU : in out CPU_T); end Processor.Eagle_IO_P;

46.481481

81

0.768924

13cb19b7dcd8ffa2096fd3607b5f9b153db22943

2,593

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-szuzha.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-szuzha.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-szuzha.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . S T R I N G S . W I D E _ U N B O U N D E D . W I D E _ H A S H -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-2009, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with System.String_Hash; function Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash (Key : Unbounded_Wide_Wide_String) return Containers.Hash_Type is use Ada.Containers; function Hash is new System.String_Hash.Hash (Wide_Wide_Character, Wide_Wide_String, Hash_Type); begin return Hash (To_Wide_Wide_String (Key)); end Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash;

63.243902

78

0.433089

040ca33b3a6c47f40cf5a302b6a1afa165ac74a3

1,282

ads

Ada

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.ads

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

3

2021-05-04T17:09:06.000Z

2021-10-04T07:19:26.000Z

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.ads

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.ads

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

-- Copyright 2018-2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- 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 -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with System; package Pck is type Float_Array is array (Integer range <>) of Integer; type Float_Ptr is access Float_Array; type Table_Type is (One, Two, Three, Four, Five); type New_Table_Array is array (Table_Type) of Float_Ptr; My_Table : New_Table_Array := (others => new Float_Array'((4 => 16#DE#, 5 => 16#AD#))); My_F : Float_Ptr := new Float_Array'(4 => 16#BE#, 5 => 16#EF#); procedure Do_Nothing (A : System.Address); end Pck;

35.611111

77

0.652106

a075f887c90a19342eb380a9d12a5c62fb6be0cf

3,272

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd3015k.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd3015k.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd3015k.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- CD3015K.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT AN ENUMERATION -- REPRESENTATION CLAUSE FOR A DERIVED TYPE CAN BE GIVEN IN THE -- VISIBLE OR PRIVATE PART OF A GENERIC PACKAGE FOR A DERIVED TYPE -- DECLARED IN THE VISIBLE PART, WHERE AN ENUMERATION CLAUSE -- HAS BEEN GIVEN FOR THE PARENT. -- HISTORY -- DHH 10/01/87 CREATED ORIGINAL TEST -- DHH 03/29/89 CHANGE FROM 'A' TEST TO 'C' TEST AND FROM '.DEP' -- '.ADA'. ADDED CHECK ON REPRESENTATION CLAUSES. WITH REPORT; USE REPORT; WITH ENUM_CHECK; -- CONTAINS A CALL TO 'FAILED'. PROCEDURE CD3015K IS BEGIN TEST ("CD3015K", "CHECK THAT AN ENUMERATION REPRESENTATION " & "CLAUSE FOR A DERIVED TYPE CAN BE GIVEN IN " & "THE VISIBLE OR PRIVATE PART OF A GENERIC " & "PACKAGE FOR A DERIVED TYPE DECLARED IN " & "THE VISIBLE PART, WHERE AN ENUMERATION " & "CLAUSE HAS BEEN GIVEN FOR THE PARENT"); DECLARE GENERIC PACKAGE GENPACK IS TYPE MAIN IS (RED,BLUE,YELLOW); FOR MAIN USE (RED => 1, BLUE => 2, YELLOW => 3); TYPE HUE IS NEW MAIN; TYPE NEWHUE IS NEW MAIN; FOR HUE USE (RED => 8, BLUE => 11, YELLOW => 12); PRIVATE FOR NEWHUE USE (RED => 6, BLUE => 12, YELLOW => 18); TYPE INT1 IS RANGE 8 .. 12; FOR INT1'SIZE USE HUE'SIZE; TYPE INT2 IS RANGE 6 .. 18; FOR INT2'SIZE USE NEWHUE'SIZE; PROCEDURE CHECK_1 IS NEW ENUM_CHECK(HUE, INT1); PROCEDURE CHECK_2 IS NEW ENUM_CHECK(NEWHUE, INT2); END GENPACK; PACKAGE BODY GENPACK IS BEGIN CHECK_1 (RED, 8, "HUE"); CHECK_2 (YELLOW, 18, "NEWHUE"); END GENPACK; PACKAGE P IS NEW GENPACK; BEGIN NULL; END; RESULT; END CD3015K;

35.182796

79

0.586797

1eb704ef10c4313d377f021ce3ea419b648108cb

1,216

ads

Ada

source/slim-messages-stat.ads

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-messages-stat.ads

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-messages-stat.ads

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- package Slim.Messages.STAT is type STAT_Message is new Message with private; subtype Event_Kind is String (1 .. 4); not overriding function Event (Self : STAT_Message) return Event_Kind; not overriding function WiFi_Level (Self : STAT_Message) return Natural; not overriding function Elapsed_Seconds (Self : STAT_Message) return Natural; private subtype Byte is Ada.Streams.Stream_Element; type STAT_Message is new Base_Message (Max_8 => 4 + 3, Max_16 => 3, Max_32 => 8, Max_64 => 1) with null record; overriding function Read (Data : not null access League.Stream_Element_Vectors.Stream_Element_Vector) return STAT_Message; overriding procedure Write (Self : STAT_Message; Tag : out Message_Tag; Data : out League.Stream_Element_Vectors.Stream_Element_Vector); overriding procedure Visit (Self : not null access STAT_Message; Visiter : in out Slim.Message_Visiters.Visiter'Class); end Slim.Messages.STAT;

27.022222

75

0.67023

4baf8f16aadc3c7dd988e375b573e8933d32c87f

3,617

ads

Ada

source/amf/uml/amf-uml-element_imports-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-element_imports-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-element_imports-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.UML.Element_Imports.Hash is new AMF.Elements.Generic_Hash (UML_Element_Import, UML_Element_Import_Access);

72.34

80

0.403373

c7b16d6a9b13b3cd8dc9fd073d57a5133bec9e48

1,108

ads

Ada

examples/utils/sdl/sdl_sdl_thread_h.ads

Fabien-Chouteau/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

13

2018-07-31T12:11:46.000Z

2021-11-19T14:16:46.000Z

examples/utils/sdl/sdl_sdl_thread_h.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

1

2018-10-22T21:41:59.000Z

examples/utils/sdl/sdl_sdl_thread_h.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

4

2020-07-03T10:03:13.000Z

2022-02-10T03:35:07.000Z

pragma Ada_2005; pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; with System; with SDL_SDL_stdinc_h; package SDL_SDL_thread_h is -- skipped empty struct SDL_Thread function SDL_CreateThread (fn : access function (arg1 : System.Address) return int; data : System.Address) return System.Address; -- ../include/SDL/SDL_thread.h:88 pragma Import (C, SDL_CreateThread, "SDL_CreateThread"); function SDL_ThreadID return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:92 pragma Import (C, SDL_ThreadID, "SDL_ThreadID"); function SDL_GetThreadID (thread : System.Address) return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:97 pragma Import (C, SDL_GetThreadID, "SDL_GetThreadID"); procedure SDL_WaitThread (thread : System.Address; status : access int); -- ../include/SDL/SDL_thread.h:103 pragma Import (C, SDL_WaitThread, "SDL_WaitThread"); procedure SDL_KillThread (thread : System.Address); -- ../include/SDL/SDL_thread.h:106 pragma Import (C, SDL_KillThread, "SDL_KillThread"); end SDL_SDL_thread_h;

39.571429

168

0.730144

a0bc71fcd69c1573235b934acf86f81b515ced48

13,289

adb

Ada

source/amf/dd/amf-internals-factories-dc_datatypes.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/dd/amf-internals-factories-dc_datatypes.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/dd/amf-internals-factories-dc_datatypes.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.CMOF.Properties; with AMF.Holders.Reals; with AMF.Internals.Elements; with AMF.Internals.Objects; with League.Holders.Integers; with AMF.DC.Holders.Bounds; with AMF.DC.Holders.Colors; with AMF.DC.Holders.Dimensions; with AMF.DC.Holders.Points; with AMF.Internals.Tables.DC_Metamodel; package body AMF.Internals.Factories.DC_Datatypes is function Bounds_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder; procedure Bounds_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder); function Color_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder; procedure Color_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder); function Dimension_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder; procedure Dimension_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder); function Point_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder; procedure Point_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder); ---------------- -- Bounds_Get -- ---------------- function Bounds_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : constant AMF.DC.DC_Bounds := AMF.DC.Holders.Bounds.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_X then return AMF.Holders.Reals.To_Holder (V.X); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Y then return AMF.Holders.Reals.To_Holder (V.Y); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Width then return AMF.Holders.Reals.To_Holder (V.Width); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Height then return AMF.Holders.Reals.To_Holder (V.Height); else raise Program_Error; end if; end Bounds_Get; ---------------- -- Bounds_Set -- ---------------- procedure Bounds_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder) is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : AMF.DC.DC_Bounds := AMF.DC.Holders.Bounds.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_X then V.X := AMF.Holders.Reals.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Y then V.Y := AMF.Holders.Reals.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Width then V.Width := AMF.Holders.Reals.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Bounds_Height then V.Height := AMF.Holders.Reals.Element (Value); else raise Program_Error; end if; AMF.DC.Holders.Bounds.Replace_Element (Object, V); end Bounds_Set; --------------- -- Color_Get -- --------------- function Color_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : constant AMF.DC.DC_Color := AMF.DC.Holders.Colors.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Red then return League.Holders.Integers.To_Holder (V.Red); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Green then return League.Holders.Integers.To_Holder (V.Green); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Blue then return League.Holders.Integers.To_Holder (V.Blue); else raise Program_Error; end if; end Color_Get; --------------- -- Color_Set -- --------------- procedure Color_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder) is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : AMF.DC.DC_Color := AMF.DC.Holders.Colors.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Red then V.Red := League.Holders.Integers.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Green then V.Green := League.Holders.Integers.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Color_Blue then V.Blue := League.Holders.Integers.Element (Value); else raise Program_Error; end if; AMF.DC.Holders.Colors.Replace_Element (Object, V); end Color_Set; ------------------- -- Dimension_Get -- ------------------- function Dimension_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : constant AMF.DC.DC_Dimension := AMF.DC.Holders.Dimensions.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Dimension_Width then return AMF.Holders.Reals.To_Holder (V.Width); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Dimension_Height then return AMF.Holders.Reals.To_Holder (V.Height); else raise Program_Error; end if; end Dimension_Get; ------------------- -- Dimension_Set -- ------------------- procedure Dimension_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder) is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : AMF.DC.DC_Dimension := AMF.DC.Holders.Dimensions.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Dimension_Width then V.Width := AMF.Holders.Reals.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Dimension_Height then V.Height := AMF.Holders.Reals.Element (Value); else raise Program_Error; end if; AMF.DC.Holders.Dimensions.Replace_Element (Object, V); end Dimension_Set; --------------- -- Point_Get -- --------------- function Point_Get (Object : League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : constant AMF.DC.DC_Point := AMF.DC.Holders.Points.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Point_X then return AMF.Holders.Reals.To_Holder (V.X); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Point_Y then return AMF.Holders.Reals.To_Holder (V.Y); else raise Program_Error; end if; end Point_Get; --------------- -- Point_Set -- --------------- procedure Point_Set (Object : in out League.Holders.Holder; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder) is P : constant AMF.Internals.CMOF_Element := AMF.Internals.Elements.Element_Base'Class (Property.all).Element; V : AMF.DC.DC_Point := AMF.DC.Holders.Points.Element (Object); begin if P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Point_X then V.X := AMF.Holders.Reals.Element (Value); elsif P = AMF.Internals.Tables.DC_Metamodel.MP_DC_Point_Y then V.Y := AMF.Holders.Reals.Element (Value); else raise Program_Error; end if; AMF.DC.Holders.Points.Replace_Element (Object, V); end Point_Set; Bounds_Descriptor : aliased AMF.Internals.Objects.Object_Type_Descriptor := (Bounds_Get'Access, Bounds_Set'Access); Color_Descriptor : aliased AMF.Internals.Objects.Object_Type_Descriptor := (Color_Get'Access, Color_Set'Access); Dimension_Descriptor : aliased AMF.Internals.Objects.Object_Type_Descriptor := (Dimension_Get'Access, Dimension_Set'Access); Point_Descriptor : aliased AMF.Internals.Objects.Object_Type_Descriptor := (Point_Get'Access, Point_Set'Access); begin AMF.Internals.Objects.Registry.Insert (AMF.DC.Holders.Bounds.Value_Tag, Bounds_Descriptor'Access); AMF.Internals.Objects.Registry.Insert (AMF.DC.Holders.Colors.Value_Tag, Color_Descriptor'Access); AMF.Internals.Objects.Registry.Insert (AMF.DC.Holders.Dimensions.Value_Tag, Dimension_Descriptor'Access); AMF.Internals.Objects.Registry.Insert (AMF.DC.Holders.Points.Value_Tag, Point_Descriptor'Access); end AMF.Internals.Factories.DC_Datatypes;

38.630814

78

0.604334

8b06c91e0366f7f90b28c9f3e6a1b190facaf987

2,816

adb

Ada

src/ewok-sleep.adb

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/ewok-sleep.adb

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/ewok-sleep.adb

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

-- -- Copyright 2018 The wookey project team <[email protected]> -- - Ryad Benadjila -- - Arnauld Michelizza -- - Mathieu Renard -- - Philippe Thierry -- - Philippe Trebuchet -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. -- -- with ewok.tasks; use ewok.tasks; with ewok.tasks_shared; use ewok.tasks_shared; package body ewok.sleep with spark_mode => off is package TSK renames ewok.tasks; procedure sleeping (task_id : in t_real_task_id; ms : in milliseconds; mode : in t_sleep_mode) is begin awakening_time(task_id) := m4.systick.get_ticks + m4.systick.to_ticks (ms); if mode = SLEEP_MODE_INTERRUPTIBLE then TSK.set_state (task_id, TASK_MODE_MAINTHREAD, TASK_STATE_SLEEPING); else -- SLEEP_MODE_DEEP TSK.set_state (task_id, TASK_MODE_MAINTHREAD, TASK_STATE_SLEEPING_DEEP); end if; end sleeping; procedure check_is_awoke is t : constant m4.systick.t_tick := m4.systick.get_ticks; begin for id in applications.list'range loop if (TSK.tasks_list(id).state = TASK_STATE_SLEEPING or TSK.tasks_list(id).state = TASK_STATE_SLEEPING_DEEP) and then t > awakening_time(id) then TSK.set_state (id, TASK_MODE_MAINTHREAD, TASK_STATE_RUNNABLE); end if; end loop; end check_is_awoke; procedure try_waking_up (task_id : in t_real_task_id) is begin if TSK.tasks_list(task_id).state = TASK_STATE_SLEEPING or else awakening_time(task_id) < m4.systick.get_ticks then TSK.set_state (task_id, TASK_MODE_MAINTHREAD, TASK_STATE_RUNNABLE); end if; end try_waking_up; function is_sleeping (task_id : in t_real_task_id) return boolean is begin if TSK.tasks_list(task_id).state = TASK_STATE_SLEEPING or TSK.tasks_list(task_id).state = TASK_STATE_SLEEPING_DEEP then if awakening_time(task_id) > m4.systick.get_ticks then return true; else TSK.set_state (task_id, TASK_MODE_MAINTHREAD, TASK_STATE_RUNNABLE); return false; end if; else return false; end if; end is_sleeping; end ewok.sleep;

28.734694

81

0.662642

9ad15db830604350d78f8b00f7803aed0d8c4f28

5,736

adb

Ada

tools-src/gnu/gcc/gcc/ada/s-valenu.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/s-valenu.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/s-valenu.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . V A L _ E N U M -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2000, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Unchecked_Conversion; with System.Val_Util; use System.Val_Util; package body System.Val_Enum is ------------------------- -- Value_Enumeration_8 -- ------------------------- function Value_Enumeration_8 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural is F : Natural; L : Natural; S : String (Str'Range) := Str; type Natural_8 is range 0 .. 2 ** 7 - 1; type Index_Table is array (Natural) of Natural_8; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin Normalize_String (S, F, L); for J in 0 .. Num loop if Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1) = S (F .. L) then return J; end if; end loop; raise Constraint_Error; end Value_Enumeration_8; -------------------------- -- Value_Enumeration_16 -- -------------------------- function Value_Enumeration_16 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural is F : Natural; L : Natural; S : String (Str'Range) := Str; type Natural_16 is range 0 .. 2 ** 15 - 1; type Index_Table is array (Natural) of Natural_16; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin Normalize_String (S, F, L); for J in 0 .. Num loop if Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1) = S (F .. L) then return J; end if; end loop; raise Constraint_Error; end Value_Enumeration_16; -------------------------- -- Value_Enumeration_32 -- -------------------------- function Value_Enumeration_32 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural is F : Natural; L : Natural; S : String (Str'Range) := Str; type Natural_32 is range 0 .. 2 ** 31 - 1; type Index_Table is array (Natural) of Natural_32; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin Normalize_String (S, F, L); for J in 0 .. Num loop if Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1) = S (F .. L) then return J; end if; end loop; raise Constraint_Error; end Value_Enumeration_32; end System.Val_Enum;

36.075472

78

0.477859

a0ec3e866dab8a7fac869769875a3c45e33e6f8c

802

ads

Ada

build_gnu/binutils/gdb/testsuite/gdb.ada/atomic_enum/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2017-05-31T21:42:12.000Z

build_gnu/binutils/gdb/testsuite/gdb.ada/atomic_enum/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

null

build_gnu/binutils/gdb/testsuite/gdb.ada/atomic_enum/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2019-12-17T22:04:07.000Z

-- Copyright 2008-2014 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- 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 -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package Pck is procedure Increment; function Is_First return Boolean; end Pck;

36.454545

73

0.739401

4b9d45ec2aede87a0b8e01c6da33689f6516c51b

4,870

adb

Ada

source/amf/mof/cmof/amf-internals-cmof_redefinable_elements.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-internals-cmof_redefinable_elements.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-internals-cmof_redefinable_elements.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Internals.Element_Collections; with AMF.Internals.Tables.CMOF_Attributes; package body AMF.Internals.CMOF_Redefinable_Elements is use AMF.Internals.Tables.CMOF_Attributes; ----------------- -- Get_Is_Leaf -- ----------------- overriding function Get_Is_Leaf (Self : not null access constant CMOF_Redefinable_Element_Proxy) return Boolean is begin return Internal_Get_Is_Leaf (Self.Element); end Get_Is_Leaf; --------------------------- -- Get_Redefined_Element -- --------------------------- overriding function Get_Redefined_Element (Self : not null access constant CMOF_Redefinable_Element_Proxy) return AMF.CMOF.Redefinable_Elements.Collections.Set_Of_CMOF_Redefinable_Element is begin return AMF.CMOF.Redefinable_Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (Internal_Get_Redefined_Element (Self.Element))); end Get_Redefined_Element; ------------------------------ -- Get_Redefinition_Context -- ------------------------------ overriding function Get_Redefinition_Context (Self : not null access constant CMOF_Redefinable_Element_Proxy) return AMF.CMOF.Classifiers.Collections.Set_Of_CMOF_Classifier is begin return AMF.CMOF.Classifiers.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (Internal_Get_Redefinition_Context (Self.Element))); end Get_Redefinition_Context; end AMF.Internals.CMOF_Redefinable_Elements;

53.516484

90

0.480082

ad6e82830816817cb647732226f184e1f1bf4fc2

5,325

ads

Ada

source/amf/dd/amf-dg-patterns.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/dd/amf-dg-patterns.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/dd/amf-dg-patterns.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ -- Pattern is a kind of fill that paints a graphical element (a tile) -- repeatedly at fixed intervals in x and y axes to cover the areas to be -- filled. ------------------------------------------------------------------------------ limited with AMF.DC; with AMF.DG.Fills; limited with AMF.DG.Graphical_Elements; package AMF.DG.Patterns is pragma Preelaborate; type DG_Pattern is limited interface and AMF.DG.Fills.DG_Fill; type DG_Pattern_Access is access all DG_Pattern'Class; for DG_Pattern_Access'Storage_Size use 0; not overriding function Get_Bounds (Self : not null access constant DG_Pattern) return AMF.DC.DC_Bounds is abstract; -- Getter of Pattern::bounds. -- -- the bounds of the pattern that define a private coordinate system for -- the pattern's tile. not overriding procedure Set_Bounds (Self : not null access DG_Pattern; To : AMF.DC.DC_Bounds) is abstract; -- Setter of Pattern::bounds. -- -- the bounds of the pattern that define a private coordinate system for -- the pattern's tile. not overriding function Get_Tile (Self : not null access constant DG_Pattern) return AMF.DG.Graphical_Elements.DG_Graphical_Element_Access is abstract; -- Getter of Pattern::tile. -- -- a reference to a graphical element, owned by the pattern, that works as -- a tile to be painted repeatedly at a fixed interval to fill an closed -- area. not overriding procedure Set_Tile (Self : not null access DG_Pattern; To : AMF.DG.Graphical_Elements.DG_Graphical_Element_Access) is abstract; -- Setter of Pattern::tile. -- -- a reference to a graphical element, owned by the pattern, that works as -- a tile to be painted repeatedly at a fixed interval to fill an closed -- area. end AMF.DG.Patterns;

53.25

80

0.48507

a023967de26dc1969d83d7501ea2685f43740f69

9,168

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a53e.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a53e.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a53e.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- CD2A53E.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT WHEN SIZE AND SMALL SPECIFICATIONS ARE GIVEN FOR A -- FIXED POINT TYPE, THEN OPERATIONS ON VALUES OF SUCH A TYPE -- ARE NOT AFFECTED BY THE REPRESENTATION CLAUSE WHEN THE TYPE -- IS PASSED AS A GENERIC ACTUAL PARAMETER. -- HISTORY: -- BCB 08/24/87 CREATED ORIGINAL TEST. -- DHH 04/12/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA' AND CHANGED -- OPERATORS ON 'SIZE TESTS. -- WMC 04/01/92 ELIMINATED TEST REDUNDANCIES. -- MRM 07/16/92 FIX ALIGNMENT OF BLOCK BODY -- PWN 02/02/95 REMOVED INCONSISTENCIES WITH ADA 9X. WITH REPORT; USE REPORT; PROCEDURE CD2A53E IS BASIC_SIZE : CONSTANT := INTEGER'SIZE/2; BASIC_SMALL : CONSTANT := 2.0 ** (-4); B : BOOLEAN; TYPE CHECK_TYPE IS DELTA 1.0 RANGE -4.0 .. 4.0; FOR CHECK_TYPE'SMALL USE BASIC_SMALL; FOR CHECK_TYPE'SIZE USE BASIC_SIZE; BEGIN TEST ("CD2A53E", "CHECK THAT WHEN SIZE AND SMALL SPECIFICATIONS " & "ARE GIVEN FOR A FIXED POINT TYPE, THEN " & "OPERATIONS ON VALUES OF SUCH A TYPE ARE NOT " & "AFFECTED BY THE REPRESENTATION CLAUSE WHEN " & "THE TYPE IS PASSED AS A GENERIC ACTUAL " & "PARAMETER"); DECLARE GENERIC TYPE FIXED_ELEMENT IS DELTA <>; FUNCTION FUNC RETURN BOOLEAN; FUNCTION FUNC RETURN BOOLEAN IS ZERO : CONSTANT := 0.0; TYPE BASIC_TYPE IS DELTA 2.0 ** (-4) RANGE -4.0 .. 4.0; CNEG1 : FIXED_ELEMENT := -3.5; CNEG2 : FIXED_ELEMENT := FIXED_ELEMENT (-1.0/3.0); CPOS1 : FIXED_ELEMENT := FIXED_ELEMENT (4.0/6.0); CPOS2 : FIXED_ELEMENT := 3.5; CZERO : FIXED_ELEMENT; TYPE ARRAY_TYPE IS ARRAY (0 .. 3) OF FIXED_ELEMENT; CHARRAY : ARRAY_TYPE := (-3.5, FIXED_ELEMENT (-1.0/3.0), FIXED_ELEMENT (4.0/6.0), 3.5); TYPE REC_TYPE IS RECORD COMPF : FIXED_ELEMENT := -3.5; COMPN : FIXED_ELEMENT := FIXED_ELEMENT (-1.0/3.0); COMPP : FIXED_ELEMENT := FIXED_ELEMENT (4.0/6.0); COMPL : FIXED_ELEMENT := 3.5; END RECORD; CHREC : REC_TYPE; FUNCTION IDENT (FX : FIXED_ELEMENT) RETURN FIXED_ELEMENT IS BEGIN IF EQUAL (3, 3) THEN RETURN FX; ELSE RETURN 0.0; END IF; END IDENT; PROCEDURE PROC (CN1IN, CP1IN : FIXED_ELEMENT; CN2INOUT,CP2INOUT : IN OUT FIXED_ELEMENT; CZOUT : OUT FIXED_ELEMENT) IS BEGIN IF +IDENT (CN2INOUT) NOT IN -0.375 .. -0.3125 OR IDENT (-CP1IN) NOT IN -0.6875 .. -0.625 THEN FAILED ("INCORRECT RESULTS FOR " & "UNARY ADDING OPERATORS - 1"); END IF; IF ABS IDENT (CN2INOUT) NOT IN 0.3125 .. 0.375 OR IDENT (ABS CP1IN) NOT IN 0.625 .. 0.6875 THEN FAILED ("INCORRECT RESULTS FOR " & "ABSOLUTE VALUE OPERATORS - 1"); END IF; CZOUT := 0.0; END PROC; BEGIN -- FUNC PROC (CNEG1, CPOS1, CNEG2, CPOS2, CZERO); IF IDENT (CZERO) /= ZERO THEN FAILED ("INCORRECT VALUE FOR OUT PARAMETER"); END IF; IF FIXED_ELEMENT'LAST < IDENT (3.9375) THEN FAILED ("INCORRECT VALUE FOR FIXED_ELEMENT'LAST"); END IF; IF FIXED_ELEMENT'SIZE /= IDENT_INT (BASIC_SIZE) THEN FAILED ("INCORRECT VALUE FOR FIXED_ELEMENT'SIZE"); END IF; IF FIXED_ELEMENT'SMALL /= BASIC_SMALL THEN FAILED ("INCORRECT VALUE FOR FIXED_ELEMENT'SMALL"); END IF; IF FIXED_ELEMENT'AFT /= 1 THEN FAILED ("INCORRECT VALUE FOR FIXED_ELEMENT'AFT"); END IF; IF CNEG1'SIZE < IDENT_INT(BASIC_SIZE) THEN FAILED ("INCORRECT VALUE FOR CNEG1'SIZE"); END IF; IF IDENT (CNEG1) + CPOS1 NOT IN -2.875 .. -2.8125 OR CPOS2 - IDENT (CPOS1) NOT IN 2.8125 .. 2.875 THEN FAILED ("INCORRECT RESULTS FOR BINARY ADDING " & "OPERATORS - 2"); END IF; IF FIXED_ELEMENT (CNEG1 * IDENT (CPOS1)) NOT IN -2.4375 .. -2.1875 OR FIXED_ELEMENT (IDENT (CNEG2) / CPOS2) NOT IN -0.125 .. -0.0625 THEN FAILED ("INCORRECT RESULTS FOR MULTIPLYING " & "OPERATORS - 2"); END IF; IF IDENT (CPOS1) NOT IN 0.625 .. 0.6875 OR CNEG2 IN -0.25 .. 0.0 OR IDENT (CNEG2) IN -1.0 .. -0.4375 THEN FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " & "OPERATORS - 2"); END IF; IF CHARRAY(1)'SIZE < IDENT_INT(BASIC_SIZE) THEN FAILED ("INCORRECT VALUE FOR CHARRAY(1)'SIZE"); END IF; IF +IDENT (CHARRAY (1)) NOT IN -0.375 .. -0.3125 OR IDENT (-CHARRAY (2)) NOT IN -0.6875 .. -0.625 THEN FAILED ("INCORRECT RESULTS FOR UNARY ADDING " & "OPERATORS - 3"); END IF; IF ABS IDENT (CHARRAY (1)) NOT IN 0.3125 .. 0.375 OR IDENT (ABS CHARRAY (2)) NOT IN 0.625 .. 0.6875 THEN FAILED ("INCORRECT RESULTS FOR ABSOLUTE VALUE " & "OPERATORS - 3"); END IF; IF IDENT (CHARRAY (2)) NOT IN 0.625 .. 0.6875 OR CHARRAY (1) IN -0.25 .. 0.0 OR IDENT (CHARRAY (1)) IN -1.0 .. -0.4375 THEN FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " & "OPERATORS - 3"); END IF; IF CHREC.COMPP'SIZE < IDENT_INT(BASIC_SIZE) THEN FAILED ("INCORRECT VALUE FOR CHREC.COMPP'SIZE"); END IF; IF IDENT (CHREC.COMPF) + CHREC.COMPP NOT IN -2.875 .. -2.8125 OR CHREC.COMPL - IDENT (CHREC.COMPP) NOT IN 2.8125 .. 2.875 THEN FAILED ("INCORRECT RESULTS FOR BINARY ADDING " & "OPERATORS - 4"); END IF; IF FIXED_ELEMENT (CHREC.COMPF * IDENT (CHREC.COMPP)) NOT IN -2.4375 .. -2.1875 OR FIXED_ELEMENT (IDENT (CHREC.COMPN) / CHREC.COMPL) NOT IN -0.125 .. -0.0625 THEN FAILED ("INCORRECT RESULTS FOR MULTIPLYING " & "OPERATORS - 4"); END IF; IF IDENT (CHREC.COMPP) NOT IN 0.625 .. 0.6875 OR CHREC.COMPN IN -0.25 .. 0.0 OR IDENT (CHREC.COMPN) IN -1.0 .. -0.4375 THEN FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " & "OPERATORS - 4"); END IF; RETURN TRUE; END FUNC; FUNCTION NEWFUNC IS NEW FUNC(CHECK_TYPE); BEGIN B := NEWFUNC; END; RESULT; END CD2A53E;

38.847458

79

0.488656

04ad92bd51d16e3a79560f5b8d68e439fef416c5

50,788

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_intr.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_intr.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_intr.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E X P _ I N T R -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Checks; use Checks; with Einfo; use Einfo; with Elists; use Elists; with Expander; use Expander; with Exp_Atag; use Exp_Atag; with Exp_Ch4; use Exp_Ch4; with Exp_Ch7; use Exp_Ch7; with Exp_Ch11; use Exp_Ch11; with Exp_Code; use Exp_Code; with Exp_Fixd; use Exp_Fixd; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Inline; use Inline; with Nmake; use Nmake; with Nlists; use Nlists; with Opt; use Opt; with Restrict; use Restrict; with Rident; use Rident; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aux; use Sem_Aux; with Sem_Eval; use Sem_Eval; with Sem_Res; use Sem_Res; with Sem_Type; use Sem_Type; with Sem_Util; use Sem_Util; with Sinfo; use Sinfo; with Sinput; use Sinput; with Snames; use Snames; with Stand; use Stand; with Tbuild; use Tbuild; with Uintp; use Uintp; with Urealp; use Urealp; package body Exp_Intr is ----------------------- -- Local Subprograms -- ----------------------- procedure Expand_Binary_Operator_Call (N : Node_Id); -- Expand a call to an intrinsic arithmetic operator when the operand -- types or sizes are not identical. procedure Expand_Is_Negative (N : Node_Id); -- Expand a call to the intrinsic Is_Negative function procedure Expand_Dispatching_Constructor_Call (N : Node_Id); -- Expand a call to an instantiation of Generic_Dispatching_Constructor -- into a dispatching call to the actual subprogram associated with the -- Constructor formal subprogram, passing it the Parameters actual of -- the call to the instantiation and dispatching based on call's Tag -- parameter. procedure Expand_Exception_Call (N : Node_Id; Ent : RE_Id); -- Expand a call to Exception_Information/Message/Name. The first -- parameter, N, is the node for the function call, and Ent is the -- entity for the corresponding routine in the Ada.Exceptions package. procedure Expand_Import_Call (N : Node_Id); -- Expand a call to Import_Address/Longest_Integer/Value. The parameter -- N is the node for the function call. procedure Expand_Shift (N : Node_Id; E : Entity_Id; K : Node_Kind); -- Expand an intrinsic shift operation, N and E are from the call to -- Expand_Intrinsic_Call (call node and subprogram spec entity) and -- K is the kind for the shift node procedure Expand_Unc_Conversion (N : Node_Id; E : Entity_Id); -- Expand a call to an instantiation of Unchecked_Conversion into a node -- N_Unchecked_Type_Conversion. procedure Expand_Unc_Deallocation (N : Node_Id); -- Expand a call to an instantiation of Unchecked_Deallocation into a node -- N_Free_Statement and appropriate context. procedure Expand_To_Address (N : Node_Id); procedure Expand_To_Pointer (N : Node_Id); -- Expand a call to corresponding function, declared in an instance of -- System.Address_To_Access_Conversions. procedure Expand_Source_Info (N : Node_Id; Nam : Name_Id); -- Rewrite the node as the appropriate string literal or positive -- constant. Nam is the name of one of the intrinsics declared in -- GNAT.Source_Info; see g-souinf.ads for documentation of these -- intrinsics. --------------------- -- Add_Source_Info -- --------------------- procedure Add_Source_Info (Buf : in out Bounded_String; Loc : Source_Ptr; Nam : Name_Id) is begin case Nam is when Name_Line => Append (Buf, Nat (Get_Logical_Line_Number (Loc))); when Name_File => Append (Buf, Reference_Name (Get_Source_File_Index (Loc))); when Name_Source_Location => Build_Location_String (Buf, Loc); when Name_Enclosing_Entity => -- Skip enclosing blocks to reach enclosing unit declare Ent : Entity_Id := Current_Scope; begin while Present (Ent) loop exit when Ekind (Ent) not in E_Block | E_Loop; Ent := Scope (Ent); end loop; -- Ent now points to the relevant defining entity Append_Entity_Name (Buf, Ent); end; when Name_Compilation_ISO_Date => Append (Buf, Opt.Compilation_Time (1 .. 10)); when Name_Compilation_Date => declare subtype S13 is String (1 .. 3); Months : constant array (1 .. 12) of S13 := ("Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"); M1 : constant Character := Opt.Compilation_Time (6); M2 : constant Character := Opt.Compilation_Time (7); MM : constant Natural range 1 .. 12 := (Character'Pos (M1) - Character'Pos ('0')) * 10 + (Character'Pos (M2) - Character'Pos ('0')); begin -- Reformat ISO date into MMM DD YYYY (__DATE__) format Append (Buf, Months (MM)); Append (Buf, ' '); Append (Buf, Opt.Compilation_Time (9 .. 10)); Append (Buf, ' '); Append (Buf, Opt.Compilation_Time (1 .. 4)); end; when Name_Compilation_Time => Append (Buf, Opt.Compilation_Time (12 .. 19)); when others => raise Program_Error; end case; end Add_Source_Info; --------------------------------- -- Expand_Binary_Operator_Call -- --------------------------------- procedure Expand_Binary_Operator_Call (N : Node_Id) is T1 : constant Entity_Id := Underlying_Type (Etype (Left_Opnd (N))); T2 : constant Entity_Id := Underlying_Type (Etype (Right_Opnd (N))); TR : constant Entity_Id := Etype (N); T3 : Entity_Id; Res : Node_Id; Siz : constant Uint := UI_Max (RM_Size (T1), RM_Size (T2)); -- Maximum of operand sizes begin -- Nothing to do if the operands have the same modular type if Base_Type (T1) = Base_Type (T2) and then Is_Modular_Integer_Type (T1) then return; end if; -- Use Unsigned_32 for sizes of 32 or below, else Unsigned_64 if Siz > 32 then T3 := RTE (RE_Unsigned_64); else T3 := RTE (RE_Unsigned_32); end if; -- Copy operator node, and reset type and entity fields, for -- subsequent reanalysis. Res := New_Copy (N); Set_Etype (Res, T3); case Nkind (N) is when N_Op_And => Set_Entity (Res, Standard_Op_And); when N_Op_Or => Set_Entity (Res, Standard_Op_Or); when N_Op_Xor => Set_Entity (Res, Standard_Op_Xor); when others => raise Program_Error; end case; -- Convert operands to large enough intermediate type Set_Left_Opnd (Res, Unchecked_Convert_To (T3, Relocate_Node (Left_Opnd (N)))); Set_Right_Opnd (Res, Unchecked_Convert_To (T3, Relocate_Node (Right_Opnd (N)))); -- Analyze and resolve result formed by conversion to target type Rewrite (N, Unchecked_Convert_To (TR, Res)); Analyze_And_Resolve (N, TR); end Expand_Binary_Operator_Call; ----------------------------------------- -- Expand_Dispatching_Constructor_Call -- ----------------------------------------- -- Transform a call to an instantiation of Generic_Dispatching_Constructor -- of the form: -- GDC_Instance (The_Tag, Parameters'Access) -- to a class-wide conversion of a dispatching call to the actual -- associated with the formal subprogram Construct, designating The_Tag -- as the controlling tag of the call: -- T'Class (Construct'Actual (Params)) -- Controlling tag is The_Tag -- which will eventually be expanded to the following: -- T'Class (The_Tag.all (Construct'Actual'Index).all (Params)) -- A class-wide membership test is also generated, preceding the call, to -- ensure that the controlling tag denotes a type in T'Class. procedure Expand_Dispatching_Constructor_Call (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Tag_Arg : constant Node_Id := First_Actual (N); Param_Arg : constant Node_Id := Next_Actual (Tag_Arg); Subp_Decl : constant Node_Id := Parent (Parent (Entity (Name (N)))); Inst_Pkg : constant Node_Id := Parent (Subp_Decl); Act_Rename : Node_Id; Act_Constr : Entity_Id; Iface_Tag : Node_Id := Empty; Cnstr_Call : Node_Id; Result_Typ : Entity_Id; begin -- Remove side effects from tag argument early, before rewriting -- the dispatching constructor call, as Remove_Side_Effects relies -- on Tag_Arg's Parent link properly attached to the tree (once the -- call is rewritten, the Parent is inconsistent as it points to the -- rewritten node, which is not the syntactic parent of the Tag_Arg -- anymore). Remove_Side_Effects (Tag_Arg); -- Check that we have a proper tag Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Make_Op_Eq (Loc, Left_Opnd => New_Copy_Tree (Tag_Arg), Right_Opnd => New_Occurrence_Of (RTE (RE_No_Tag), Loc)), Then_Statements => New_List ( Make_Raise_Statement (Loc, New_Occurrence_Of (RTE (RE_Tag_Error), Loc))))); -- Check that it is not the tag of an abstract type Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Is_Abstract), Loc), Parameter_Associations => New_List (New_Copy_Tree (Tag_Arg))), Then_Statements => New_List ( Make_Raise_Statement (Loc, New_Occurrence_Of (RTE (RE_Tag_Error), Loc))))); -- The subprogram is the third actual in the instantiation, and is -- retrieved from the corresponding renaming declaration. However, -- freeze nodes may appear before, so we retrieve the declaration -- with an explicit loop. Act_Rename := First (Visible_Declarations (Inst_Pkg)); while Nkind (Act_Rename) /= N_Subprogram_Renaming_Declaration loop Next (Act_Rename); end loop; Act_Constr := Entity (Name (Act_Rename)); Result_Typ := Class_Wide_Type (Etype (Act_Constr)); -- Check that the accessibility level of the tag is no deeper than that -- of the constructor function (unless CodePeer_Mode) if not CodePeer_Mode then Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Make_Op_Gt (Loc, Left_Opnd => Build_Get_Access_Level (Loc, New_Copy_Tree (Tag_Arg)), Right_Opnd => Make_Integer_Literal (Loc, Scope_Depth (Act_Constr))), Then_Statements => New_List ( Make_Raise_Statement (Loc, New_Occurrence_Of (RTE (RE_Tag_Error), Loc))))); end if; if Is_Interface (Etype (Act_Constr)) then -- If the result type is not known to be a parent of Tag_Arg then we -- need to locate the tag of the secondary dispatch table. if not Is_Ancestor (Etype (Result_Typ), Etype (Tag_Arg), Use_Full_View => True) and then Tagged_Type_Expansion then -- Obtain the reference to the Ada.Tags service before generating -- the Object_Declaration node to ensure that if this service is -- not available in the runtime then we generate a clear error. declare Fname : constant Node_Id := New_Occurrence_Of (RTE (RE_Secondary_Tag), Loc); begin pragma Assert (not Is_Interface (Etype (Tag_Arg))); -- The tag is the first entry in the dispatch table of the -- return type of the constructor. Iface_Tag := Make_Object_Declaration (Loc, Defining_Identifier => Make_Temporary (Loc, 'V'), Object_Definition => New_Occurrence_Of (RTE (RE_Tag), Loc), Expression => Make_Function_Call (Loc, Name => Fname, Parameter_Associations => New_List ( Relocate_Node (Tag_Arg), New_Occurrence_Of (Node (First_Elmt (Access_Disp_Table (Etype (Act_Constr)))), Loc)))); Insert_Action (N, Iface_Tag); end; end if; end if; -- Create the call to the actual Constructor function Cnstr_Call := Make_Function_Call (Loc, Name => New_Occurrence_Of (Act_Constr, Loc), Parameter_Associations => New_List (Relocate_Node (Param_Arg))); -- Establish its controlling tag from the tag passed to the instance -- The tag may be given by a function call, in which case a temporary -- should be generated now, to prevent out-of-order insertions during -- the expansion of that call when stack-checking is enabled. if Present (Iface_Tag) then Set_Controlling_Argument (Cnstr_Call, New_Occurrence_Of (Defining_Identifier (Iface_Tag), Loc)); else Set_Controlling_Argument (Cnstr_Call, Relocate_Node (Tag_Arg)); end if; -- Rewrite and analyze the call to the instance as a class-wide -- conversion of the call to the actual constructor. When the result -- type is a class-wide interface type this conversion is required to -- force the displacement of the pointer to the object to reference the -- corresponding dispatch table. Rewrite (N, Convert_To (Result_Typ, Cnstr_Call)); -- Do not generate a run-time check on the built object if tag -- checks are suppressed for the result type or tagged type expansion -- is disabled or if CodePeer_Mode. if Tag_Checks_Suppressed (Etype (Result_Typ)) or else not Tagged_Type_Expansion or else CodePeer_Mode then null; -- Generate a class-wide membership test to ensure that the call's tag -- argument denotes a type within the class. We must keep separate the -- case in which the Result_Type of the constructor function is a tagged -- type from the case in which it is an abstract interface because the -- run-time subprogram required to check these cases differ (and have -- one difference in their parameters profile). -- Call CW_Membership if the Result_Type is a tagged type to look for -- the tag in the table of ancestor tags. elsif not Is_Interface (Result_Typ) then Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Make_Op_Not (Loc, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_CW_Membership), Loc), Parameter_Associations => New_List ( New_Copy_Tree (Tag_Arg), New_Occurrence_Of ( Node (First_Elmt (Access_Disp_Table ( Root_Type (Result_Typ)))), Loc)))), Then_Statements => New_List ( Make_Raise_Statement (Loc, Name => New_Occurrence_Of (RTE (RE_Tag_Error), Loc))))); -- Call IW_Membership test if the Result_Type is an abstract interface -- to look for the tag in the table of interface tags. else Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Make_Op_Not (Loc, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Prefix => New_Copy_Tree (Tag_Arg), Attribute_Name => Name_Address), New_Occurrence_Of ( Node (First_Elmt (Access_Disp_Table ( Root_Type (Result_Typ)))), Loc)))), Then_Statements => New_List ( Make_Raise_Statement (Loc, Name => New_Occurrence_Of (RTE (RE_Tag_Error), Loc))))); end if; Analyze_And_Resolve (N, Etype (Act_Constr)); end Expand_Dispatching_Constructor_Call; --------------------------- -- Expand_Exception_Call -- --------------------------- -- If the function call is not within an exception handler, then the call -- is replaced by a null string. Otherwise the appropriate routine in -- Ada.Exceptions is called passing the choice parameter specification -- from the enclosing handler. If the enclosing handler lacks a choice -- parameter, then one is supplied. procedure Expand_Exception_Call (N : Node_Id; Ent : RE_Id) is Loc : constant Source_Ptr := Sloc (N); P : Node_Id; E : Entity_Id; begin -- Climb up parents to see if we are in exception handler P := Parent (N); loop -- Case of not in exception handler, replace by null string if No (P) then Rewrite (N, Make_String_Literal (Loc, Strval => "")); exit; -- Case of in exception handler elsif Nkind (P) = N_Exception_Handler then -- Handler cannot be used for a local raise, and furthermore, this -- is a violation of the No_Exception_Propagation restriction. Set_Local_Raise_Not_OK (P); Check_Restriction (No_Exception_Propagation, N); -- If no choice parameter present, then put one there. Note that -- we do not need to put it on the entity chain, since no one will -- be referencing it by normal visibility methods. if No (Choice_Parameter (P)) then E := Make_Temporary (Loc, 'E'); Set_Choice_Parameter (P, E); Set_Ekind (E, E_Variable); Set_Etype (E, RTE (RE_Exception_Occurrence)); Set_Scope (E, Current_Scope); end if; Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (Ent), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (Choice_Parameter (P), Loc)))); exit; -- Keep climbing else P := Parent (P); end if; end loop; Analyze_And_Resolve (N, Standard_String); end Expand_Exception_Call; ------------------------ -- Expand_Import_Call -- ------------------------ -- The function call must have a static string as its argument. We create -- a dummy variable which uses this string as the external name in an -- Import pragma. The result is then obtained as the address of this -- dummy variable, converted to the appropriate target type. procedure Expand_Import_Call (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Ent : constant Entity_Id := Entity (Name (N)); Str : constant Node_Id := First_Actual (N); Dum : constant Entity_Id := Make_Temporary (Loc, 'D'); begin Insert_Actions (N, New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Dum, Object_Definition => New_Occurrence_Of (Standard_Character, Loc)), Make_Pragma (Loc, Chars => Name_Import, Pragma_Argument_Associations => New_List ( Make_Pragma_Argument_Association (Loc, Expression => Make_Identifier (Loc, Name_Ada)), Make_Pragma_Argument_Association (Loc, Expression => Make_Identifier (Loc, Chars (Dum))), Make_Pragma_Argument_Association (Loc, Chars => Name_Link_Name, Expression => Relocate_Node (Str)))))); Rewrite (N, Unchecked_Convert_To (Etype (Ent), Make_Attribute_Reference (Loc, Prefix => Make_Identifier (Loc, Chars (Dum)), Attribute_Name => Name_Address))); Analyze_And_Resolve (N, Etype (Ent)); end Expand_Import_Call; --------------------------- -- Expand_Intrinsic_Call -- --------------------------- procedure Expand_Intrinsic_Call (N : Node_Id; E : Entity_Id) is Nam : Name_Id; begin -- If an external name is specified for the intrinsic, it is handled -- by the back-end: leave the call node unchanged for now. if Present (Interface_Name (E)) then return; end if; -- If the intrinsic subprogram is generic, gets its original name if Present (Parent (E)) and then Present (Generic_Parent (Parent (E))) then Nam := Chars (Generic_Parent (Parent (E))); else Nam := Chars (E); end if; if Nam = Name_Asm then Expand_Asm_Call (N); elsif Nam = Name_Divide then Expand_Decimal_Divide_Call (N); elsif Nam = Name_Exception_Information then Expand_Exception_Call (N, RE_Exception_Information); elsif Nam = Name_Exception_Message then Expand_Exception_Call (N, RE_Exception_Message); elsif Nam = Name_Exception_Name then Expand_Exception_Call (N, RE_Exception_Name_Simple); elsif Nam = Name_Generic_Dispatching_Constructor then Expand_Dispatching_Constructor_Call (N); elsif Nam in Name_Import_Address | Name_Import_Largest_Value | Name_Import_Value then Expand_Import_Call (N); elsif Nam = Name_Is_Negative then Expand_Is_Negative (N); elsif Nam = Name_Rotate_Left then Expand_Shift (N, E, N_Op_Rotate_Left); elsif Nam = Name_Rotate_Right then Expand_Shift (N, E, N_Op_Rotate_Right); elsif Nam = Name_Shift_Left then Expand_Shift (N, E, N_Op_Shift_Left); elsif Nam = Name_Shift_Right then Expand_Shift (N, E, N_Op_Shift_Right); elsif Nam = Name_Shift_Right_Arithmetic then Expand_Shift (N, E, N_Op_Shift_Right_Arithmetic); elsif Nam = Name_Unchecked_Conversion then Expand_Unc_Conversion (N, E); elsif Nam = Name_Unchecked_Deallocation then Expand_Unc_Deallocation (N); elsif Nam = Name_To_Address then Expand_To_Address (N); elsif Nam = Name_To_Pointer then Expand_To_Pointer (N); elsif Nam in Name_File | Name_Line | Name_Source_Location | Name_Enclosing_Entity | Name_Compilation_ISO_Date | Name_Compilation_Date | Name_Compilation_Time then Expand_Source_Info (N, Nam); -- If we have a renaming, expand the call to the original operation, -- which must itself be intrinsic, since renaming requires matching -- conventions and this has already been checked. elsif Present (Alias (E)) then Expand_Intrinsic_Call (N, Alias (E)); elsif Nkind (N) in N_Binary_Op then Expand_Binary_Operator_Call (N); -- The only other case is where an external name was specified, since -- this is the only way that an otherwise unrecognized name could -- escape the checking in Sem_Prag. Nothing needs to be done in such -- a case, since we pass such a call to the back end unchanged. else null; end if; end Expand_Intrinsic_Call; ------------------------ -- Expand_Is_Negative -- ------------------------ procedure Expand_Is_Negative (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Opnd : constant Node_Id := Relocate_Node (First_Actual (N)); begin -- We replace the function call by the following expression -- if Opnd < 0.0 then -- True -- else -- if Opnd > 0.0 then -- False; -- else -- Float_Unsigned!(Float (Opnd)) /= 0 -- end if; -- end if; Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Lt (Loc, Left_Opnd => Duplicate_Subexpr (Opnd), Right_Opnd => Make_Real_Literal (Loc, Ureal_0)), New_Occurrence_Of (Standard_True, Loc), Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Gt (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Opnd), Right_Opnd => Make_Real_Literal (Loc, Ureal_0)), New_Occurrence_Of (Standard_False, Loc), Make_Op_Ne (Loc, Left_Opnd => Unchecked_Convert_To (RTE (RE_Float_Unsigned), Convert_To (Standard_Float, Duplicate_Subexpr_No_Checks (Opnd))), Right_Opnd => Make_Integer_Literal (Loc, 0))))))); Analyze_And_Resolve (N, Standard_Boolean); end Expand_Is_Negative; ------------------ -- Expand_Shift -- ------------------ -- This procedure is used to convert a call to a shift function to the -- corresponding operator node. This conversion is not done by the usual -- circuit for converting calls to operator functions (e.g. "+"(1,2)) to -- operator nodes, because shifts are not predefined operators. -- As a result, whenever a shift is used in the source program, it will -- remain as a call until converted by this routine to the operator node -- form which the back end is expecting to see. -- Note: it is possible for the expander to generate shift operator nodes -- directly, which will be analyzed in the normal manner by calling Analyze -- and Resolve. Such shift operator nodes will not be seen by Expand_Shift. procedure Expand_Shift (N : Node_Id; E : Entity_Id; K : Node_Kind) is Entyp : constant Entity_Id := Etype (E); Left : constant Node_Id := First_Actual (N); Loc : constant Source_Ptr := Sloc (N); Right : constant Node_Id := Next_Actual (Left); Ltyp : constant Node_Id := Etype (Left); Rtyp : constant Node_Id := Etype (Right); Typ : constant Entity_Id := Etype (N); Snode : Node_Id; begin Snode := New_Node (K, Loc); Set_Right_Opnd (Snode, Relocate_Node (Right)); Set_Chars (Snode, Chars (E)); Set_Etype (Snode, Base_Type (Entyp)); Set_Entity (Snode, E); if Compile_Time_Known_Value (Type_High_Bound (Rtyp)) and then Expr_Value (Type_High_Bound (Rtyp)) < Esize (Ltyp) then Set_Shift_Count_OK (Snode, True); end if; if Typ = Entyp then -- Note that we don't call Analyze and Resolve on this node, because -- it already got analyzed and resolved when it was a function call. Set_Left_Opnd (Snode, Relocate_Node (Left)); Rewrite (N, Snode); Set_Analyzed (N); -- However, we do call the expander, so that the expansion for -- rotates and shift_right_arithmetic happens if Modify_Tree_For_C -- is set. if Expander_Active then Expand (N); end if; else -- If the context type is not the type of the operator, it is an -- inherited operator for a derived type. Wrap the node in a -- conversion so that it is type-consistent for possible further -- expansion (e.g. within a lock-free protected type). Set_Left_Opnd (Snode, Unchecked_Convert_To (Base_Type (Entyp), Relocate_Node (Left))); Rewrite (N, Unchecked_Convert_To (Typ, Snode)); -- Analyze and resolve result formed by conversion to target type Analyze_And_Resolve (N, Typ); end if; end Expand_Shift; ------------------------ -- Expand_Source_Info -- ------------------------ procedure Expand_Source_Info (N : Node_Id; Nam : Name_Id) is Loc : constant Source_Ptr := Sloc (N); begin -- Integer cases if Nam = Name_Line then Rewrite (N, Make_Integer_Literal (Loc, Intval => UI_From_Int (Int (Get_Logical_Line_Number (Loc))))); Analyze_And_Resolve (N, Standard_Positive); -- String cases else declare Buf : Bounded_String; begin Add_Source_Info (Buf, Loc, Nam); Rewrite (N, Make_String_Literal (Loc, Strval => +Buf)); Analyze_And_Resolve (N, Standard_String); end; end if; Set_Is_Static_Expression (N); end Expand_Source_Info; --------------------------- -- Expand_Unc_Conversion -- --------------------------- procedure Expand_Unc_Conversion (N : Node_Id; E : Entity_Id) is Func : constant Entity_Id := Entity (Name (N)); Conv : Node_Id; Ftyp : Entity_Id; Ttyp : Entity_Id; begin -- Rewrite as unchecked conversion node. Note that we must convert -- the operand to the formal type of the input parameter of the -- function, so that the resulting N_Unchecked_Type_Conversion -- call indicates the correct types for Gigi. -- Right now, we only do this if a scalar type is involved. It is -- not clear if it is needed in other cases. If we do attempt to -- do the conversion unconditionally, it crashes 3411-018. To be -- investigated further ??? Conv := Relocate_Node (First_Actual (N)); Ftyp := Etype (First_Formal (Func)); if Is_Scalar_Type (Ftyp) then Conv := Convert_To (Ftyp, Conv); Set_Parent (Conv, N); Analyze_And_Resolve (Conv); end if; -- The instantiation of Unchecked_Conversion creates a wrapper package, -- and the target type is declared as a subtype of the actual. Recover -- the actual, which is the subtype indic. in the subtype declaration -- for the target type. This is semantically correct, and avoids -- anomalies with access subtypes. For entities, leave type as is. -- We do the analysis here, because we do not want the compiler -- to try to optimize or otherwise reorganize the unchecked -- conversion node. Ttyp := Etype (E); if Is_Entity_Name (Conv) then null; elsif Nkind (Parent (Ttyp)) = N_Subtype_Declaration then Ttyp := Entity (Subtype_Indication (Parent (Etype (E)))); elsif Is_Itype (Ttyp) then Ttyp := Entity (Subtype_Indication (Associated_Node_For_Itype (Ttyp))); else raise Program_Error; end if; Rewrite (N, Unchecked_Convert_To (Ttyp, Conv)); Set_Etype (N, Ttyp); Set_Analyzed (N); if Nkind (N) = N_Unchecked_Type_Conversion then Expand_N_Unchecked_Type_Conversion (N); end if; end Expand_Unc_Conversion; ----------------------------- -- Expand_Unc_Deallocation -- ----------------------------- procedure Expand_Unc_Deallocation (N : Node_Id) is Arg : constant Node_Id := First_Actual (N); Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (Arg); Desig_Typ : constant Entity_Id := Available_View (Designated_Type (Typ)); Needs_Fin : constant Boolean := Needs_Finalization (Desig_Typ); Root_Typ : constant Entity_Id := Underlying_Type (Root_Type (Typ)); Pool : constant Entity_Id := Associated_Storage_Pool (Root_Typ); Stmts : constant List_Id := New_List; Arg_Known_Non_Null : constant Boolean := Known_Non_Null (N); -- This captures whether we know the argument to be non-null so that -- we can avoid the test. The reason that we need to capture this is -- that we analyze some generated statements before properly attaching -- them to the tree, and that can disturb current value settings. Exceptions_OK : constant Boolean := not Restriction_Active (No_Exception_Propagation); Abrt_Blk : Node_Id := Empty; Abrt_Blk_Id : Entity_Id; Abrt_HSS : Node_Id; AUD : Entity_Id; Fin_Blk : Node_Id; Fin_Call : Node_Id; Fin_Data : Finalization_Exception_Data; Free_Arg : Node_Id; Free_Nod : Node_Id; Gen_Code : Node_Id; Obj_Ref : Node_Id; begin -- Nothing to do if we know the argument is null if Known_Null (N) then return; end if; -- Processing for pointer to controlled types. Generate: -- Abrt : constant Boolean := ...; -- Ex : Exception_Occurrence; -- Raised : Boolean := False; -- begin -- Abort_Defer; -- begin -- [Deep_]Finalize (Obj_Ref); -- exception -- when others => -- if not Raised then -- Raised := True; -- Save_Occurrence (Ex, Get_Current_Excep.all.all); -- end; -- at end -- Abort_Undefer_Direct; -- end; -- Depending on whether exception propagation is enabled and/or aborts -- are allowed, the generated code may lack block statements. if Needs_Fin then -- Ada 2005 (AI-251): In case of abstract interface type we displace -- the pointer to reference the base of the object to deallocate its -- memory, unless we're targetting a VM, in which case no special -- processing is required. if Is_Interface (Directly_Designated_Type (Typ)) and then Tagged_Type_Expansion then Obj_Ref := Make_Explicit_Dereference (Loc, Prefix => Unchecked_Convert_To (Typ, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Base_Address), Loc), Parameter_Associations => New_List ( Unchecked_Convert_To (RTE (RE_Address), Duplicate_Subexpr_No_Checks (Arg)))))); else Obj_Ref := Make_Explicit_Dereference (Loc, Prefix => Duplicate_Subexpr_No_Checks (Arg)); end if; -- If the designated type is tagged, the finalization call must -- dispatch because the designated type may not be the actual type -- of the object. If the type is synchronized, the deallocation -- applies to the corresponding record type. if Is_Tagged_Type (Desig_Typ) then if Is_Concurrent_Type (Desig_Typ) then Obj_Ref := Unchecked_Convert_To (Class_Wide_Type (Corresponding_Record_Type (Desig_Typ)), Obj_Ref); elsif not Is_Class_Wide_Type (Desig_Typ) then Obj_Ref := Unchecked_Convert_To (Class_Wide_Type (Desig_Typ), Obj_Ref); end if; -- Otherwise the designated type is untagged. Set the type of the -- dereference explicitly to force a conversion when needed given -- that [Deep_]Finalize may be inherited from a parent type. else Set_Etype (Obj_Ref, Desig_Typ); end if; -- Generate: -- [Deep_]Finalize (Obj_Ref); Fin_Call := Make_Final_Call (Obj_Ref => Obj_Ref, Typ => Desig_Typ); -- Generate: -- Abrt : constant Boolean := ...; -- Ex : Exception_Occurrence; -- Raised : Boolean := False; -- begin -- <Fin_Call> -- exception -- when others => -- if not Raised then -- Raised := True; -- Save_Occurrence (Ex, Get_Current_Excep.all.all); -- end; if Exceptions_OK then Build_Object_Declarations (Fin_Data, Stmts, Loc); Fin_Blk := Make_Block_Statement (Loc, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List (Fin_Call), Exception_Handlers => New_List ( Build_Exception_Handler (Fin_Data)))); -- Otherwise exception propagation is not allowed else Fin_Blk := Fin_Call; end if; -- The finalization action must be protected by an abort defer and -- undefer pair when aborts are allowed. Generate: -- begin -- Abort_Defer; -- <Fin_Blk> -- at end -- Abort_Undefer_Direct; -- end; if Abort_Allowed then AUD := RTE (RE_Abort_Undefer_Direct); Abrt_HSS := Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Build_Runtime_Call (Loc, RE_Abort_Defer), Fin_Blk), At_End_Proc => New_Occurrence_Of (AUD, Loc)); Abrt_Blk := Make_Block_Statement (Loc, Handled_Statement_Sequence => Abrt_HSS); Add_Block_Identifier (Abrt_Blk, Abrt_Blk_Id); Expand_At_End_Handler (Abrt_HSS, Abrt_Blk_Id); -- Present the Abort_Undefer_Direct function to the backend so -- that it can inline the call to the function. Add_Inlined_Body (AUD, N); -- Otherwise aborts are not allowed else Abrt_Blk := Fin_Blk; end if; Append_To (Stmts, Abrt_Blk); end if; -- For a task type, call Free_Task before freeing the ATCB. We used to -- detect the case of Abort followed by a Free here, because the Free -- wouldn't actually free if it happens before the aborted task actually -- terminates. The warning was removed, because Free now works properly -- (the task will be freed once it terminates). if Is_Task_Type (Desig_Typ) then Append_To (Stmts, Cleanup_Task (N, Duplicate_Subexpr_No_Checks (Arg))); -- For composite types that contain tasks, recurse over the structure -- to build the selectors for the task subcomponents. elsif Has_Task (Desig_Typ) then if Is_Array_Type (Desig_Typ) then Append_List_To (Stmts, Cleanup_Array (N, Arg, Desig_Typ)); elsif Is_Record_Type (Desig_Typ) then Append_List_To (Stmts, Cleanup_Record (N, Arg, Desig_Typ)); end if; end if; -- Same for simple protected types. Eventually call Finalize_Protection -- before freeing the PO for each protected component. if Is_Simple_Protected_Type (Desig_Typ) then Append_To (Stmts, Cleanup_Protected_Object (N, Duplicate_Subexpr_No_Checks (Arg))); elsif Has_Simple_Protected_Object (Desig_Typ) then if Is_Array_Type (Desig_Typ) then Append_List_To (Stmts, Cleanup_Array (N, Arg, Desig_Typ)); elsif Is_Record_Type (Desig_Typ) then Append_List_To (Stmts, Cleanup_Record (N, Arg, Desig_Typ)); end if; end if; -- Normal processing for non-controlled types. The argument to free is -- a renaming rather than a constant to ensure that the original context -- is always set to null after the deallocation takes place. Free_Arg := Duplicate_Subexpr_No_Checks (Arg, Renaming_Req => True); Free_Nod := Make_Free_Statement (Loc, Empty); Append_To (Stmts, Free_Nod); Set_Storage_Pool (Free_Nod, Pool); -- Attach to tree before analysis of generated subtypes below Set_Parent (Stmts, Parent (N)); -- Deal with storage pool if Present (Pool) then -- Freeing the secondary stack is meaningless if Is_RTE (Pool, RE_SS_Pool) then null; -- If the pool object is of a simple storage pool type, then attempt -- to locate the type's Deallocate procedure, if any, and set the -- free operation's procedure to call. If the type doesn't have a -- Deallocate (which is allowed), then the actual will simply be set -- to null. elsif Present (Get_Rep_Pragma (Etype (Pool), Name_Simple_Storage_Pool_Type)) then declare Pool_Typ : constant Entity_Id := Base_Type (Etype (Pool)); Dealloc : Entity_Id; begin Dealloc := Get_Name_Entity_Id (Name_Deallocate); while Present (Dealloc) loop if Scope (Dealloc) = Scope (Pool_Typ) and then Present (First_Formal (Dealloc)) and then Etype (First_Formal (Dealloc)) = Pool_Typ then Set_Procedure_To_Call (Free_Nod, Dealloc); exit; else Dealloc := Homonym (Dealloc); end if; end loop; end; -- Case of a class-wide pool type: make a dispatching call to -- Deallocate through the class-wide Deallocate_Any. elsif Is_Class_Wide_Type (Etype (Pool)) then Set_Procedure_To_Call (Free_Nod, RTE (RE_Deallocate_Any)); -- Case of a specific pool type: make a statically bound call else Set_Procedure_To_Call (Free_Nod, Find_Prim_Op (Etype (Pool), Name_Deallocate)); end if; end if; if Present (Procedure_To_Call (Free_Nod)) then -- For all cases of a Deallocate call, the back-end needs to be able -- to compute the size of the object being freed. This may require -- some adjustments for objects of dynamic size. -- -- If the type is class wide, we generate an implicit type with the -- right dynamic size, so that the deallocate call gets the right -- size parameter computed by GIGI. Same for an access to -- unconstrained packed array. if Is_Class_Wide_Type (Desig_Typ) or else (Is_Array_Type (Desig_Typ) and then not Is_Constrained (Desig_Typ) and then Is_Packed (Desig_Typ)) then declare Deref : constant Node_Id := Make_Explicit_Dereference (Loc, Duplicate_Subexpr_No_Checks (Arg)); D_Subtyp : Node_Id; D_Type : Entity_Id; begin -- Perform minor decoration as it is needed by the side effect -- removal mechanism. Set_Etype (Deref, Desig_Typ); Set_Parent (Deref, Free_Nod); D_Subtyp := Make_Subtype_From_Expr (Deref, Desig_Typ); if Nkind (D_Subtyp) in N_Has_Entity then D_Type := Entity (D_Subtyp); else D_Type := Make_Temporary (Loc, 'A'); Insert_Action (Deref, Make_Subtype_Declaration (Loc, Defining_Identifier => D_Type, Subtype_Indication => D_Subtyp)); end if; -- Force freezing at the point of the dereference. For the -- class wide case, this avoids having the subtype frozen -- before the equivalent type. Freeze_Itype (D_Type, Deref); Set_Actual_Designated_Subtype (Free_Nod, D_Type); end; end if; end if; -- Ada 2005 (AI-251): In case of abstract interface type we must -- displace the pointer to reference the base of the object to -- deallocate its memory, unless we're targetting a VM, in which case -- no special processing is required. -- Generate: -- free (Base_Address (Obj_Ptr)) if Is_Interface (Directly_Designated_Type (Typ)) and then Tagged_Type_Expansion then Set_Expression (Free_Nod, Unchecked_Convert_To (Typ, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Base_Address), Loc), Parameter_Associations => New_List ( Unchecked_Convert_To (RTE (RE_Address), Free_Arg))))); -- Generate: -- free (Obj_Ptr) else Set_Expression (Free_Nod, Free_Arg); end if; -- Only remaining step is to set result to null, or generate a raise of -- Constraint_Error if the target object is "not null". if Can_Never_Be_Null (Etype (Arg)) then Append_To (Stmts, Make_Raise_Constraint_Error (Loc, Reason => CE_Access_Check_Failed)); else declare Lhs : constant Node_Id := Duplicate_Subexpr_No_Checks (Arg); begin Set_Assignment_OK (Lhs); Append_To (Stmts, Make_Assignment_Statement (Loc, Name => Lhs, Expression => Make_Null (Loc))); end; end if; -- Generate a test of whether any earlier finalization raised an -- exception, and in that case raise Program_Error with the previous -- exception occurrence. -- Generate: -- if Raised and then not Abrt then -- raise Program_Error; -- for restricted RTS -- <or> -- Raise_From_Controlled_Operation (E); -- all other cases -- end if; if Needs_Fin and then Exceptions_OK then Append_To (Stmts, Build_Raise_Statement (Fin_Data)); end if; -- If we know the argument is non-null, then make a block statement -- that contains the required statements, no need for a test. if Arg_Known_Non_Null then Gen_Code := Make_Block_Statement (Loc, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts)); -- If the argument may be null, wrap the statements inside an IF that -- does an explicit test to exclude the null case. else Gen_Code := Make_Implicit_If_Statement (N, Condition => Make_Op_Ne (Loc, Left_Opnd => Duplicate_Subexpr (Arg), Right_Opnd => Make_Null (Loc)), Then_Statements => Stmts); end if; -- Rewrite the call Rewrite (N, Gen_Code); Analyze (N); end Expand_Unc_Deallocation; ----------------------- -- Expand_To_Address -- ----------------------- procedure Expand_To_Address (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Arg : constant Node_Id := First_Actual (N); Obj : Node_Id; begin Remove_Side_Effects (Arg); Obj := Make_Explicit_Dereference (Loc, Relocate_Node (Arg)); Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => New_Copy_Tree (Arg), Right_Opnd => Make_Null (Loc)), New_Occurrence_Of (RTE (RE_Null_Address), Loc), Make_Attribute_Reference (Loc, Prefix => Obj, Attribute_Name => Name_Address)))); Analyze_And_Resolve (N, RTE (RE_Address)); end Expand_To_Address; ----------------------- -- Expand_To_Pointer -- ----------------------- procedure Expand_To_Pointer (N : Node_Id) is Arg : constant Node_Id := First_Actual (N); begin Rewrite (N, Unchecked_Convert_To (Etype (N), Arg)); Analyze (N); end Expand_To_Pointer; end Exp_Intr;

36.277143

79

0.575608

04b74df565220a1fc1c72d0fb9f9cf8d7dafc0d4

16,980

ads

Ada

bb-runtimes/runtimes/ravenscar-sfp-stm32f3x4/gnarl/s-taskin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-sfp-stm32f3x4/gnarl/s-taskin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-sfp-stm32f3x4/gnarl/s-taskin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the Ravenscar/HI-E version of this package -- Note: the compiler generates direct calls to this interface, via Rtsfind. -- Any changes to this interface may require corresponding compiler changes. pragma Restrictions (No_Elaboration_Code); -- The Initialize procedure is called by System.Init.Runtime_Initialize prior -- to the elaboration procs, and we must enforce that nothing in the latter -- might clobber what the early inits did. This is very tricky in presence of -- elaboration code for this unit, so we make sure this unit does not contain -- any elaboration code and use a number of Suppress_Initialization pragmas to -- honor the restriction. The code relies on a few components of globals being -- implicitly initialized to 0, still. This is achieved by the startup code -- clearing the bss section. with Ada.Unchecked_Conversion; with System.Multiprocessors; with System.Parameters; with System.Secondary_Stack; with System.Storage_Elements; with System.Task_Info; with System.Task_Primitives; package System.Tasking is pragma Preelaborate; --------------------------------- -- Task_Id related definitions -- --------------------------------- type Ada_Task_Control_Block; type Task_Id is access all Ada_Task_Control_Block; function To_Task_Id is new Ada.Unchecked_Conversion (System.Task_Primitives.Task_Address, Task_Id); function To_Address is new Ada.Unchecked_Conversion (Task_Id, System.Task_Primitives.Task_Address); Null_Task : constant Task_Id := null; type Task_List is array (Positive range <>) of Task_Id; pragma Suppress_Initialization (Task_List); function Self return Task_Id; -- This is the compiler interface version of this function. Do not call -- from the run-time system. ----------------------- -- Enumeration types -- ----------------------- type Task_States is (Unactivated, -- Task was created but has not been activated. It cannot be executing -- For all states from here down, the task has been activated. In -- addition, for all states from here down, except for Terminated, -- the task may be executing. Runnable, -- Task is not blocked for any reason known to Ada. (It may be waiting -- for a mutex, though.) It is conceptually "executing" in normal mode. Terminated, -- The task is terminated, in the sense of ARM 9.3 (5) Activator_Sleep, -- Task is waiting for created tasks to complete activation Acceptor_Sleep, -- Task is waiting on an accept or selective wait statement Entry_Caller_Sleep, -- Task is waiting on an entry call Async_Select_Sleep, -- Task is waiting to start the abortable part of an asynchronous select -- statement. Delay_Sleep, -- Task is waiting on a delay statement Master_Completion_Sleep, -- Master completion has two phases. In Phase 1 the task is sleeping -- in Complete_Master having completed a master within itself, and is -- waiting for the tasks dependent on that master to become terminated -- or waiting on a terminate Phase. Master_Phase_2_Sleep, -- In Phase 2 the task is sleeping in Complete_Master waiting for tasks -- on terminate alternatives to finish terminating. Interrupt_Server_Idle_Sleep, Interrupt_Server_Blocked_Interrupt_Sleep, Timer_Server_Sleep, AST_Server_Sleep, -- Special uses of sleep, for server tasks within the run-time system Asynchronous_Hold, -- The task has been held by Asynchronous_Task_Control.Hold_Task Interrupt_Server_Blocked_On_Event_Flag -- The task has been blocked on a system call waiting for the -- completion event. ); -- The following status indicators are never used in a Ravenscar run time. -- They Are defined for debugging purposes: The same code in GDB to get -- the Current status of a task in a full run-time environment and in a -- Ravenscar environment. pragma Unreferenced (Activator_Sleep); pragma Unreferenced (Acceptor_Sleep); pragma Unreferenced (Async_Select_Sleep); pragma Unreferenced (Master_Completion_Sleep); pragma Unreferenced (Master_Phase_2_Sleep); pragma Unreferenced (Interrupt_Server_Idle_Sleep); pragma Unreferenced (Interrupt_Server_Blocked_Interrupt_Sleep); pragma Unreferenced (Timer_Server_Sleep); pragma Unreferenced (AST_Server_Sleep); pragma Unreferenced (Asynchronous_Hold); pragma Unreferenced (Interrupt_Server_Blocked_On_Event_Flag); ------------------------------- -- Entry related definitions -- ------------------------------- Null_Entry : constant := 0; -- Entry index indicating no entry Max_Entry : constant := Integer'Last; -- Maximum entry index value Interrupt_Entry : constant := -2; -- Entry index for interrupt entry Cancelled_Entry : constant := -1; -- Entry index for a canceled entry type Entry_Index is range Interrupt_Entry .. Max_Entry; -- ID of an entry contained within a protected object or task Null_Task_Entry : constant := Null_Entry; -- Entry index for no task entry Max_Task_Entry : constant := Max_Entry; -- Maximum entry index for a task type Task_Entry_Index is new Entry_Index range Null_Task_Entry .. Max_Task_Entry; -- ID of an entry contained in a task. -- -- Note: while we do not support task entries on this runtime, we defined -- Task_Entry_Index so the Ada_Task_Control_Block type preserves its -- Entry_Num discriminate for capability with other runtimes (so the -- expander does not have to accommodate different versions) type Entry_Call_Record; -- Holds the information required to process an entry call type Entry_Call_Link is access all Entry_Call_Record; ---------------------------------- -- Entry_Call_Record definition -- ---------------------------------- type Entry_Call_Record is record Self : Task_Id; -- ID of the caller Uninterpreted_Data : System.Address; -- Data passed by the compiler Next : Entry_Call_Link; -- Entry_Call List end record; pragma Suppress_Initialization (Entry_Call_Record); ------------------------------------------- -- Task termination procedure definition -- ------------------------------------------- -- We need to redefine this type (already defined in Ada.Task_Termination) -- here to avoid circular dependencies. type Termination_Handler is access protected procedure (T : Task_Id); -- Represent a protected procedure to be executed when a task terminates Fall_Back_Handler : Termination_Handler; -- This is the fall-back handler that applies to all the tasks in the -- partition (this is only for Ravenscar-compliant systems). ------------------------------------ -- Other Task-Related Definitions -- ------------------------------------ Idle_Priority : constant Integer := Any_Priority'First - 1; -- A priority lower than any user priority. Used by the idle task subtype Extended_Priority is Integer range Idle_Priority .. Any_Priority'Last; -- Priority range that also includes the idle priority type Activation_Chain is limited private; type Activation_Chain_Access is access all Activation_Chain; type Task_Procedure_Access is access procedure (Arg : System.Address); type Access_Boolean is access all Boolean; ---------------------------------------------- -- Ada_Task_Control_Block (ATCB) definition -- ---------------------------------------------- -- Notes on protection (synchronization) of TRTS data structures -- Any field of the TCB can be written by the activator of a task when the -- task is created, since no other task can access the new task's state -- until creation is complete. -- The protection for each field is described in a comment starting with -- "Protection:". -- When a lock is used to protect an ATCB field, this lock is simply named -- Some protection is described in terms of tasks related to the ATCB being -- protected. These are: -- Self: The task which is controlled by this ATCB. -- Activator: The task that created Self and initiated its activation. -- Created: A task created and activated by Self. type Stack_Info is record Start_Address : System.Address := System.Null_Address; Size : System.Storage_Elements.Storage_Offset; end record; pragma Suppress_Initialization (Stack_Info); type TSD is record Pri_Stack_Info : aliased Stack_Info; -- Stack address and size of the task Sec_Stack_Ptr : System.Secondary_Stack.SS_Stack_Ptr; -- Pointer of currently allocated secondary stack end record; pragma Suppress_Initialization (TSD); type Common_ATCB is record State : Task_States; pragma Atomic (State); -- Encodes some basic information about the state of a task, including -- whether it has been activated, whether it is sleeping, and whether -- it is terminated. -- -- Protection: Only accessed by Self Base_CPU : System.Multiprocessors.CPU_Range; -- Protection: Only written during initialization, accessed by anyone Base_Priority : Extended_Priority; -- Base priority -- -- Protection: Only written by Self, accessed by anyone Protected_Action_Nesting : Natural; pragma Atomic (Protected_Action_Nesting); -- The dynamic level of protected action nesting for this task. This -- field is needed for checking whether potentially blocking operations -- are invoked from protected actions. pragma Atomic is used because it -- can be read/written from protected interrupt handlers. LL : aliased Task_Primitives.Private_Data; -- Control block used by underlying low-level tasking service (GNULLI) -- -- Protection: This is used only by the GNULLI implementation, which -- takes care of all of its synchronization. Task_Arg : System.Address; -- The argument to task procedure. Currently unused, this will provide -- a handle for discriminant information. -- -- Protection: Part of the synchronization between Self and Activator. -- Activator writes it, once, before Self starts executing. Thereafter, -- Self only reads it. Task_Entry_Point : Task_Procedure_Access; -- Information needed to call the procedure containing the code for -- the body of this task. -- -- Protection: Part of the synchronization between Self and Activator. -- Activator writes it, once, before Self starts executing. Self reads -- it, once, as part of its execution. Compiler_Data : TSD; -- Task-specific data needed by compiler to store per-task structures -- -- Protection: Only accessed by Self Activation_Link : Task_Id; -- Used to link this task to a list of tasks to be activated -- -- Protection: Only used by Activator. Once the task is activated, this -- can also be reused by System.Tasking.Debug for the list of known -- tasks. Task_Info : System.Task_Info.Task_Info_Type; -- System-specific attributes of the task as specified by the -- Task_Info pragma. end record; pragma Suppress_Initialization (Common_ATCB); type Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is record -- The discriminant Entry_Num is not needed, but we keep it here for -- compatibility reasons with the rest of the run times, so that the -- expander does not need to know which run time is being used. Common : Common_ATCB; Entry_Call : aliased Entry_Call_Record; -- Protection: This field is used on entry call queues associated with -- protected objects, and is protected by the protected object lock. end record; pragma Suppress_Initialization (Ada_Task_Control_Block); ---------------------------------- -- Secondary Stack Manipulation -- ---------------------------------- function Get_Sec_Stack return System.Secondary_Stack.SS_Stack_Ptr; pragma Export (C, Get_Sec_Stack, "__gnat_get_secondary_stack"); -- Return the address of the task specific secondary stack, as expected by -- System.Secondary_Stack. ---------------------------------------- -- Task size, priority, affinity info -- ---------------------------------------- function Storage_Size (T : Task_Id) return System.Parameters.Size_Type; -- Retrieve from the TCB of the task the allocated size of its stack, -- either the system default or the size specified by a pragma. This -- is in general a non-static value that can depend on discriminants -- of the task. Unspecified_Priority : constant := -1; -- No specified priority. This value is also hard-coded in gnatbind. Unspecified_CPU : constant := -1; -- No affinity specified -------------------- -- Initialization -- -------------------- procedure Initialize; -- This procedure constitutes the first part of the initialization of the -- GNARL. This includes creating data structures to make the initial thread -- into the environment task. The last part of the initialization is done -- in System.Tasking.Initialization or System.Tasking.Restricted.Stages. -- All the initializations used to be in Tasking.Initialization, but this -- is no longer possible with the run time simplification (including -- optimized PO and the restricted run time) since one cannot rely on -- System.Tasking.Initialization being present, as was done before. procedure Initialize_ATCB (Task_Entry_Point : Task_Procedure_Access; Task_Arg : System.Address; Base_Priority : Extended_Priority; Base_CPU : System.Multiprocessors.CPU_Range; Task_Info : System.Task_Info.Task_Info_Type; Stack_Address : System.Address; Stack_Size : System.Parameters.Size_Type; T : Task_Id; Success : out Boolean); -- Initialize fields of a TCB and link into global TCB structures -- Call this only with abort deferred and holding All_Tasks_L. private type Activation_Chain is limited record T_ID : Task_Id; end record; end System.Tasking;

40.428571

79

0.620848

38424f6e5640314126cc2f19ece130fbadee68ce

56,045

ads

Ada

tools-src/gnu/gcc/gcc/ada/g-spipat.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/g-spipat.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/g-spipat.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S P I T B O L . P A T T E R N S -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1997-1999 Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ -- SPITBOL-like pattern construction and matching -- This child package of GNAT.SPITBOL provides a complete implementation -- of the SPITBOL-like pattern construction and matching operations. This -- package is based on Macro-SPITBOL created by Robert Dewar. ------------------------------------------------------------ -- Summary of Pattern Matching Packages in GNAT Hierarchy -- ------------------------------------------------------------ -- There are three related packages that perform pattern maching functions. -- the following is an outline of these packages, to help you determine -- which is best for your needs. -- GNAT.Regexp (files g-regexp.ads/g-regexp.adb) -- This is a simple package providing Unix-style regular expression -- matching with the restriction that it matches entire strings. It -- is particularly useful for file name matching, and in particular -- it provides "globbing patterns" that are useful in implementing -- unix or DOS style wild card matching for file names. -- GNAT.Regpat (files g-regpat.ads/g-regpat.adb) -- This is a more complete implementation of Unix-style regular -- expressions, copied from the original V7 style regular expression -- library written in C by Henry Spencer. It is functionally the -- same as this library, and uses the same internal data structures -- stored in a binary compatible manner. -- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb) -- This is a completely general patterm matching package based on the -- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern -- language is modeled on context free grammars, with context sensitive -- extensions that provide full (type 0) computational capabilities. with Ada.Finalization; use Ada.Finalization; with Ada.Strings.Maps; use Ada.Strings.Maps; with Ada.Text_IO; use Ada.Text_IO; package GNAT.Spitbol.Patterns is pragma Elaborate_Body (Patterns); ------------------------------- -- Pattern Matching Tutorial -- ------------------------------- -- A pattern matching operation (a call to one of the Match subprograms) -- takes a subject string and a pattern, and optionally a replacement -- string. The replacement string option is only allowed if the subject -- is a variable. -- The pattern is matched against the subject string, and either the -- match fails, or it succeeds matching a contiguous substring. If a -- replacement string is specified, then the subject string is modified -- by replacing the matched substring with the given replacement. -- Concatenation and Alternation -- ============================= -- A pattern consists of a series of pattern elements. The pattern is -- built up using either the concatenation operator: -- A & B -- which means match A followed immediately by matching B, or the -- alternation operator: -- A or B -- which means first attempt to match A, and then if that does not -- succeed, match B. -- There is full backtracking, which means that if a given pattern -- element fails to match, then previous alternatives are matched. -- For example if we have the pattern: -- (A or B) & (C or D) & (E or F) -- First we attempt to match A, if that succeeds, then we go on to try -- to match C, and if that succeeds, we go on to try to match E. If E -- fails, then we try F. If F fails, then we go back and try matching -- D instead of C. Let's make this explicit using a specific example, -- and introducing the simplest kind of pattern element, which is a -- literal string. The meaning of this pattern element is simply to -- match the characters that correspond to the string characters. Now -- let's rewrite the above pattern form with specific string literals -- as the pattern elements: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- The following strings will be attempted in sequence: -- ABC . DEF . GH -- ABC . DEF . IJ -- ABC . CDE . GH -- ABC . CDE . IJ -- AB . DEF . GH -- AB . DEF . IJ -- AB . CDE . GH -- AB . CDE . IJ -- Here we use the dot simply to separate the pieces of the string -- matched by the three separate elements. -- Moving the Start Point -- ====================== -- A pattern is not required to match starting at the first character -- of the string, and is not required to match to the end of the string. -- The first attempt does indeed attempt to match starting at the first -- character of the string, trying all the possible alternatives. But -- if all alternatives fail, then the starting point of the match is -- moved one character, and all possible alternatives are attempted at -- the new anchor point. -- The entire match fails only when every possible starting point has -- been attempted. As an example, suppose that we had the subject -- string -- "ABABCDEIJKL" -- matched using the pattern in the previous example: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- would succeed, afer two anchor point moves: -- "ABABCDEIJKL" -- ^^^^^^^ -- matched -- section -- This mode of pattern matching is called the unanchored mode. It is -- also possible to put the pattern matcher into anchored mode by -- setting the global variable Anchored_Mode to True. This will cause -- all subsequent matches to be performed in anchored mode, where the -- match is required to start at the first character. -- We will also see later how the effect of an anchored match can be -- obtained for a single specified anchor point if this is desired. -- Other Pattern Elements -- ====================== -- In addition to strings (or single characters), there are many special -- pattern elements that correspond to special predefined alternations: -- Arb Matches any string. First it matches the null string, and -- then on a subsequent failure, matches one character, and -- then two characters, and so on. It only fails if the -- entire remaining string is matched. -- Bal Matches a non-empty string that is parentheses balanced -- with respect to ordinary () characters. Examples of -- balanced strings are "ABC", "A((B)C)", and "A(B)C(D)E". -- Bal matches the shortest possible balanced string on the -- first attempt, and if there is a subsequent failure, -- attempts to extend the string. -- Cancel Immediately aborts the entire pattern match, signalling -- failure. This is a specialized pattern element, which is -- useful in conjunction with some of the special pattern -- elements that have side effects. -- Fail The null alternation. Matches no possible strings, so it -- always signals failure. This is a specialized pattern -- element, which is useful in conjunction with some of the -- special pattern elements that have side effects. -- Fence Matches the null string at first, and then if a failure -- causes alternatives to be sought, aborts the match (like -- a Cancel). Note that using Fence at the start of a pattern -- has the same effect as matching in anchored mode. -- Rest Matches from the current point to the last character in -- the string. This is a specialized pattern element, which -- is useful in conjunction with some of the special pattern -- elements that have side effects. -- Succeed Repeatedly matches the null string (it is equivalent to -- the alternation ("" or "" or "" ....). This is a special -- pattern element, which is useful in conjunction with some -- of the special pattern elements that have side effects. -- Pattern Construction Functions -- ============================== -- The following functions construct additional pattern elements -- Any(S) Where S is a string, matches a single character that is -- any one of the characters in S. Fails if the current -- character is not one of the given set of characters. -- Arbno(P) Where P is any pattern, matches any number of instances -- of the pattern, starting with zero occurrences. It is -- thus equivalent to ("" or (P & ("" or (P & ("" ....)))). -- The pattern P may contain any number of pattern elements -- including the use of alternatiion and concatenation. -- Break(S) Where S is a string, matches a string of zero or more -- characters up to but not including a break character -- that is one of the characters given in the string S. -- Can match the null string, but cannot match the last -- character in the string, since a break character is -- required to be present. -- BreakX(S) Where S is a string, behaves exactly like Break(S) when -- it first matches, but if a string is successfully matched, -- then a susequent failure causes an attempt to extend the -- matched string. -- Fence(P) Where P is a pattern, attempts to match the pattern P -- including trying all possible alternatives of P. If none -- of these alternatives succeeds, then the Fence pattern -- fails. If one alternative succeeds, then the pattern -- match proceeds, but on a subsequent failure, no attempt -- is made to search for alternative matches of P. The -- pattern P may contain any number of pattern elements -- including the use of alternatiion and concatenation. -- Len(N) Where N is a natural number, matches the given number of -- characters. For example, Len(10) matches any string that -- is exactly ten characters long. -- NotAny(S) Where S is a string, matches a single character that is -- not one of the characters of S. Fails if the current -- characer is one of the given set of characters. -- NSpan(S) Where S is a string, matches a string of zero or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Always succeeds, since it can match the null string. -- Pos(N) Where N is a natural number, matches the null string -- if exactly N characters have been matched so far, and -- otherwise fails. -- Rpos(N) Where N is a natural number, matches the null string -- if exactly N characters remain to be matched, and -- otherwise fails. -- Rtab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters remain -- to be matched in the string. Fails if fewer than N -- unmatched characters remain in the string. -- Tab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters have -- been matched in all. Fails if more than N characters -- have already been matched. -- Span(S) Where S is a string, matches a string of one or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Fails if the current character is not one of the given -- set of characters. -- Recursive Pattern Matching -- ========================== -- The plus operator (+P) where P is a pattern variable, creates -- a recursive pattern that will, at pattern matching time, follow -- the pointer to obtain the referenced pattern, and then match this -- pattern. This may be used to construct recursive patterns. Consider -- for example: -- P := ("A" or ("B" & (+P))) -- On the first attempt, this pattern attempts to match the string "A". -- If this fails, then the alternative matches a "B", followed by an -- attempt to match P again. This second attempt first attempts to -- match "A", and so on. The result is a pattern that will match a -- string of B's followed by a single A. -- This particular example could simply be written as NSpan('B') & 'A', -- but the use of recursive patterns in the general case can construct -- complex patterns which could not otherwise be built. -- Pattern Assignment Operations -- ============================= -- In addition to the overall result of a pattern match, which indicates -- success or failure, it is often useful to be able to keep track of -- the pieces of the subject string that are matched by individual -- pattern elements, or subsections of the pattern. -- The pattern assignment operators allow this capability. The first -- form is the immediate assignment: -- P * S -- Here P is an arbitrary pattern, and S is a variable of type VString -- that will be set to the substring matched by P. This assignment -- happens during pattern matching, so if P matches more than once, -- then the assignment happens more than once. -- The deferred assignment operation: -- P ** S -- avoids these multiple assignments by deferring the assignment to the -- end of the match. If the entire match is successful, and if the -- pattern P was part of the successful match, then at the end of the -- matching operation the assignment to S of the string matching P is -- performed. -- The cursor assignment operation: -- Setcur(N'Access) -- assigns the current cursor position to the natural variable N. The -- cursor position is defined as the count of characters that have been -- matched so far (including any start point moves). -- Finally the operations * and ** may be used with values of type -- Text_IO.File_Access. The effect is to do a Put_Line operation of -- the matched substring. These are particularly useful in debugging -- pattern matches. -- Deferred Matching -- ================= -- The pattern construction functions (such as Len and Any) all permit -- the use of pointers to natural or string values, or functions that -- return natural or string values. These forms cause the actual value -- to be obtained at pattern matching time. This allows interesting -- possibilities for constructing dynamic patterns as illustrated in -- the examples section. -- In addition the (+S) operator may be used where S is a pointer to -- string or function returning string, with a similar deferred effect. -- A special use of deferred matching is the construction of predicate -- functions. The element (+P) where P is an access to a function that -- returns a Boolean value, causes the function to be called at the -- time the element is matched. If the function returns True, then the -- null string is matched, if the function returns False, then failure -- is signalled and previous alternatives are sought. -- Deferred Replacement -- ==================== -- The simple model given for pattern replacement (where the matched -- substring is replaced by the string given as the third argument to -- Match) works fine in simple cases, but this approach does not work -- in the case where the expression used as the replacement string is -- dependent on values set by the match. -- For example, suppose we want to find an instance of a parenthesized -- character, and replace the parentheses with square brackets. At first -- glance it would seem that: -- Match (Subject, '(' & Len (1) * Char & ')', '[' & Char & ']'); -- would do the trick, but that does not work, because the third -- argument to Match gets evaluated too early, before the call to -- Match, and before the pattern match has had a chance to set Char. -- To solve this problem we provide the deferred replacement capability. -- With this approach, which of course is only needed if the pattern -- involved has side effects, is to do the match in two stages. The -- call to Match sets a pattern result in a variable of the private -- type Match_Result, and then a subsequent Replace operation uses -- this Match_Result object to perform the required replacement. -- Using this approach, we can now write the above operation properly -- in a manner that will work: -- M : Match_Result; -- ... -- Match (Subject, '(' & Len (1) * Char & ')', M); -- Replace (M, '[' & Char & ']'); -- As with other Match cases, there is a function and procedure form -- of this match call. A call to Replace after a failed match has no -- effect. Note that Subject should not be modified between the calls. -- Examples of Pattern Matching -- ============================ -- First a simple example of the use of pattern replacement to remove -- a line number from the start of a string. We assume that the line -- number has the form of a string of decimal digits followed by a -- period, followed by one or more spaces. -- Digs : constant Pattern := Span("0123456789"); -- Lnum : constant Pattern := Pos(0) & Digs & '.' & Span(' '); -- Now to use this pattern we simply do a match with a replacement: -- Match (Line, Lnum, ""); -- which replaces the line number by the null string. Note that it is -- also possible to use an Ada.Strings.Maps.Character_Set value as an -- argument to Span and similar functions, and in particular all the -- useful constants 'in Ada.Strings.Maps.Constants are available. This -- means that we could define Digs as: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- The style we use here, of defining constant patterns and then using -- them is typical. It is possible to build up patterns dynamically, -- but it is usually more efficient to build them in pieces in advance -- using constant declarations. Note in particular that although it is -- possible to construct a pattern directly as an argument for the -- Match routine, it is much more efficient to preconstruct the pattern -- as we did in this example. -- Now let's look at the use of pattern assignment to break a -- string into sections. Suppose that the input string has two -- unsigned decimal integers, separated by spaces or a comma, -- with spaces allowed anywhere. Then we can isolate the two -- numbers with the following pattern: -- Num1, Num2 : aliased VString; -- B : constant Pattern := NSpan(' '); -- N : constant Pattern := Span("0123456789"); -- T : constant Pattern := -- NSpan(' ') & N * Num1 & Span(" ,") & N * Num2; -- The match operation Match (" 124, 257 ", T) would assign the -- string 124 to Num1 and the string 257 to Num2. -- Now let's see how more complex elements can be built from the -- set of primitive elements. The following pattern matches strings -- that have the syntax of Ada 95 based literals: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- UDigs : constant Pattern := Digs & Arbno('_' & Digs); -- Edig : constant Pattern := Span(Hexadecimal_Digit_Set); -- UEdig : constant Pattern := Edig & Arbno('_' & Edig); -- Bnum : constant Pattern := Udigs & '#' & UEdig & '#'; -- A match against Bnum will now match the desired strings, e.g. -- it will match 16#123_abc#, but not a#b#. However, this pattern -- is not quite complete, since it does not allow colons to replace -- the pound signs. The following is more complete: -- Bchar : constant Pattern := Any("#:"); -- Bnum : constant Pattern := Udigs & Bchar & UEdig & Bchar; -- but that is still not quite right, since it allows # and : to be -- mixed, and they are supposed to be used consistently. We solve -- this by using a deferred match. -- Temp : aliased VString; -- Bnum : constant Pattern := -- Udigs & Bchar * Temp & UEdig & (+Temp) -- Here the first instance of the base character is stored in Temp, and -- then later in the pattern we rematch the value that was assigned. -- For an example of a recursive pattern, let's define a pattern -- that is like the built in Bal, but the string matched is balanced -- with respect to square brackets or curly brackets. -- The language for such strings might be defined in extended BNF as -- ELEMENT ::= <any character other than [] or {}> -- | '[' BALANCED_STRING ']' -- | '{' BALANCED_STRING '}' -- BALANCED_STRING ::= ELEMENT {ELEMENT} -- Here we use {} to indicate zero or more occurrences of a term, as -- is common practice in extended BNF. Now we can translate the above -- BNF into recursive patterns as follows: -- Element, Balanced_String : aliased Pattern; -- . -- . -- . -- Element := NotAny ("[]{}") -- or -- ('[' & (+Balanced_String) & ']') -- or -- ('{' & (+Balanced_String) & '}'); -- Balanced_String := Element & Arbno (Element); -- Note the important use of + here to refer to a pattern not yet -- defined. Note also that we use assignments precisely because we -- cannot refer to as yet undeclared variables in initializations. -- Now that this pattern is constructed, we can use it as though it -- were a new primitive pattern element, and for example, the match: -- Match ("xy[ab{cd}]", Balanced_String * Current_Output & Fail); -- will generate the output: -- x -- xy -- xy[ab{cd}] -- y -- y[ab{cd}] -- [ab{cd}] -- a -- ab -- ab{cd} -- b -- b{cd} -- {cd} -- c -- cd -- d -- Note that the function of the fail here is simply to force the -- pattern Balanced_String to match all possible alternatives. Studying -- the operation of this pattern in detail is highly instructive. -- Finally we give a rather elaborate example of the use of deferred -- matching. The following declarations build up a pattern which will -- find the longest string of decimal digits in the subject string. -- Max, Cur : VString; -- Loc : Natural; -- function GtS return Boolean is -- begin -- return Length (Cur) > Length (Max); -- end GtS; -- Digit : constant Character_Set := Decimal_Digit_Set; -- Digs : constant Pattern := Span(Digit); -- Find : constant Pattern := -- "" * Max & Fence & -- initialize Max to null -- BreakX (Digit) & -- scan looking for digits -- ((Span(Digit) * Cur & -- assign next string to Cur -- (+GtS'Unrestricted_Access) & -- check size(Cur) > Size(Max) -- Setcur(Loc'Access)) -- if so, save location -- * Max) & -- and assign to Max -- Fail; -- seek all alternatives -- As we see from the comments here, complex patterns like this take -- on aspects of sequential programs. In fact they are sequential -- programs with general backtracking. In this pattern, we first use -- a pattern assignment that matches null and assigns it to Max, so -- that it is initialized for the new match. Now BreakX scans to the -- next digit. Arb would do here, but BreakX will be more efficient. -- Once we have found a digit, we scan out the longest string of -- digits with Span, and assign it to Cur. The deferred call to GtS -- tests if the string we assigned to Cur is the longest so far. If -- not, then failure is signalled, and we seek alternatives (this -- means that BreakX will extend and look for the next digit string). -- If the call to GtS succeeds then the matched string is assigned -- as the largest string so far into Max and its location is saved -- in Loc. Finally Fail forces the match to fail and seek alternatives, -- so that the entire string is searched. -- If the pattern Find is matched against a string, the variable Max -- at the end of the pattern will have the longest string of digits, -- and Loc will be the starting character location of the string. For -- example, Match("ab123cd4657ef23", Find) will assign "4657" to Max -- and 11 to Loc (indicating that the string ends with the eleventh -- character of the string). -- Note: the use of Unrestricted_Access to reference GtS will not -- be needed if GtS is defined at the outer level, but definitely -- will be necessary if GtS is a nested function (in which case of -- course the scope of the pattern Find will be restricted to this -- nested scope, and this cannot be checked, i.e. use of the pattern -- outside this scope is erroneous). Generally it is a good idea to -- define patterns and the functions they call at the outer level -- where possible, to avoid such problems. -- Correspondence with Pattern Matching in SPITBOL -- =============================================== -- Generally the Ada syntax and names correspond closely to SPITBOL -- syntax for pattern matching construction. -- The basic pattern construction operators are renamed as follows: -- Spitbol Ada -- (space) & -- | or -- $ * -- . ** -- The Ada operators were chosen so that the relative precedences of -- these operators corresponds to that of the Spitbol operators, but -- as always, the use of parentheses is advisable to clarify. -- The pattern construction operators all have similar names except for -- Spitbol Ada -- Abort Cancel -- Rem Rest -- where we have clashes with Ada reserved names. -- Ada requires the use of 'Access to refer to functions used in the -- pattern match, and often the use of 'Unrestricted_Access may be -- necessary to get around the scope restrictions if the functions -- are not declared at the outer level. -- The actual pattern matching syntax is modified in Ada as follows: -- Spitbol Ada -- X Y Match (X, Y); -- X Y = Z Match (X, Y, Z); -- and pattern failure is indicated by returning a Boolean result from -- the Match function (True for success, False for failure). ----------------------- -- Type Declarations -- ----------------------- type Pattern is private; -- Type representing a pattern. This package provides a complete set of -- operations for constructing patterns that can be used in the pattern -- matching operations provided. type Boolean_Func is access function return Boolean; -- General Boolean function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred predicate -- pattern. The function will be called when the pattern element is -- matched and failure signalled if False is returned. type Natural_Func is access function return Natural; -- General Natural function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced Natural value. type VString_Func is access function return VString; -- General VString function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced string value. subtype PString is String; -- This subtype is used in the remainder of the package to indicate a -- formal parameter that is converted to its corresponding pattern, -- i.e. a pattern that matches the characters of the string. subtype PChar is Character; -- Similarly, this subtype is used in the remainder of the package to -- indicate a formal parameter that is converted to its corresponding -- pattern, i.e. a pattern that matches this one character. subtype VString_Var is VString; subtype Pattern_Var is Pattern; -- These synonyms are used as formal parameter types to a function where, -- if the language allowed, we would use in out parameters, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interprete them properly as though they were indeed -- in out parameters. -------------------------------- -- Basic Pattern Construction -- -------------------------------- function "&" (L : Pattern; R : Pattern) return Pattern; function "&" (L : PString; R : Pattern) return Pattern; function "&" (L : Pattern; R : PString) return Pattern; function "&" (L : PChar; R : Pattern) return Pattern; function "&" (L : Pattern; R : PChar) return Pattern; -- Pattern concatenation. Matches L followed by R. function "or" (L : Pattern; R : Pattern) return Pattern; function "or" (L : PString; R : Pattern) return Pattern; function "or" (L : Pattern; R : PString) return Pattern; function "or" (L : PString; R : PString) return Pattern; function "or" (L : PChar; R : Pattern) return Pattern; function "or" (L : Pattern; R : PChar) return Pattern; function "or" (L : PChar; R : PChar) return Pattern; function "or" (L : PString; R : PChar) return Pattern; function "or" (L : PChar; R : PString) return Pattern; -- Pattern alternation. Creates a pattern that will first try to match -- L and then on a subsequent failure, attempts to match R instead. ---------------------------------- -- Pattern Assignment Functions -- ---------------------------------- function "*" (P : Pattern; Var : VString_Var) return Pattern; function "*" (P : PString; Var : VString_Var) return Pattern; function "*" (P : PChar; Var : VString_Var) return Pattern; -- Matches P, and if the match succeeds, assigns the matched substring -- to the given VString variable S. This assignment happens as soon as -- the substring is matched, and if the pattern P1 is matched more than -- once during the course of the match, then the assignment will occur -- more than once. function "**" (P : Pattern; Var : VString_Var) return Pattern; function "**" (P : PString; Var : VString_Var) return Pattern; function "**" (P : PChar; Var : VString_Var) return Pattern; -- Like "*" above, except that the assignment happens at most once -- after the entire match is completed successfully. If the match -- fails, then no assignment takes place. ---------------------------------- -- Deferred Matching Operations -- ---------------------------------- function "+" (Str : VString_Var) return Pattern; -- Here Str must be a VString variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against these characters. function "+" (Str : VString_Func) return Pattern; -- Constructs a pattern which at pattern matching time calls the given -- function, and then matches against the string or character value -- that is returned by the call. function "+" (P : Pattern_Var) return Pattern; -- Here P must be a Pattern variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against the pattern value. function "+" (P : Boolean_Func) return Pattern; -- Constructs a predicate pattern function that at pattern matching time -- calls the given function. If True is returned, then the pattern matches. -- If False is returned, then failure is signalled. -------------------------------- -- Pattern Building Functions -- -------------------------------- function Arb return Pattern; -- Constructs a pattern that will match any string. On the first attempt, -- the pattern matches a null string, then on each successive failure, it -- matches one more character, and only fails if matching the entire rest -- of the string. function Arbno (P : Pattern) return Pattern; function Arbno (P : PString) return Pattern; function Arbno (P : PChar) return Pattern; -- Pattern repetition. First matches null, then on a subsequent failure -- attempts to match an additional instance of the given pattern. -- Equivalent to (but more efficient than) P & ("" or (P & ("" or ... function Any (Str : String) return Pattern; function Any (Str : VString) return Pattern; function Any (Str : Character) return Pattern; function Any (Str : Character_Set) return Pattern; function Any (Str : access VString) return Pattern; function Any (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is one of -- the characters in the given argument. The pattern fails if the current -- character is not in Str. function Bal return Pattern; -- Constructs a pattern that will match any non-empty string that is -- parentheses balanced with respect to the normal parentheses characters. -- Attempts to extend the string if a subsequent failure occurs. function Break (Str : String) return Pattern; function Break (Str : VString) return Pattern; function Break (Str : Character) return Pattern; function Break (Str : Character_Set) return Pattern; function Break (Str : access VString) return Pattern; function Break (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a (possibly null) string which -- is immediately followed by a character in the given argument. This -- character is not part of the matched string. The pattern fails if -- the remaining characters to be matched do not include any of the -- characters in Str. function BreakX (Str : String) return Pattern; function BreakX (Str : VString) return Pattern; function BreakX (Str : Character) return Pattern; function BreakX (Str : Character_Set) return Pattern; function BreakX (Str : access VString) return Pattern; function BreakX (Str : VString_Func) return Pattern; -- Like Break, but the pattern attempts to extend on a failure to find -- the next occurrence of a character in Str, and only fails when the -- last such instance causes a failure. function Cancel return Pattern; -- Constructs a pattern that immediately aborts the entire match function Fail return Pattern; -- Constructs a pattern that always fails. function Fence return Pattern; -- Constructs a pattern that matches null on the first attempt, and then -- causes the entire match to be aborted if a subsequent failure occurs. function Fence (P : Pattern) return Pattern; -- Constructs a pattern that first matches P. if P fails, then the -- constructed pattern fails. If P succeeds, then the match proceeds, -- but if subsequent failure occurs, alternatives in P are not sought. -- The idea of Fence is that each time the pattern is matched, just -- one attempt is made to match P, without trying alternatives. function Len (Count : Natural) return Pattern; function Len (Count : access Natural) return Pattern; function Len (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches exactly the given number of -- characters. The pattern fails if fewer than this number of characters -- remain to be matched in the string. function NotAny (Str : String) return Pattern; function NotAny (Str : VString) return Pattern; function NotAny (Str : Character) return Pattern; function NotAny (Str : Character_Set) return Pattern; function NotAny (Str : access VString) return Pattern; function NotAny (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is not -- one of the characters in the given argument. The pattern Fails if -- the current character is in Str. function NSpan (Str : String) return Pattern; function NSpan (Str : VString) return Pattern; function NSpan (Str : Character) return Pattern; function NSpan (Str : Character_Set) return Pattern; function NSpan (Str : access VString) return Pattern; function NSpan (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string may be empty, so this pattern always succeeds. function Pos (Count : Natural) return Pattern; function Pos (Count : access Natural) return Pattern; function Pos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters have already been matched, and otherwise fails. function Rest return Pattern; -- Constructs a pattern that always succeeds, matching the remaining -- unmatched characters in the pattern. function Rpos (Count : Natural) return Pattern; function Rpos (Count : access Natural) return Pattern; function Rpos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters remain to be matched in the string, and otherwise fails. function Rtab (Count : Natural) return Pattern; function Rtab (Count : access Natural) return Pattern; function Rtab (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches from the current location until -- exactly Count characters remain to be matched in the string. The -- pattern fails if fewer than Count characters remain to be matched. function Setcur (Var : access Natural) return Pattern; -- Constructs a pattern that matches the null string, and assigns the -- current cursor position in the string. This value is the number of -- characters matched so far. So it is zero at the start of the match. function Span (Str : String) return Pattern; function Span (Str : VString) return Pattern; function Span (Str : Character) return Pattern; function Span (Str : Character_Set) return Pattern; function Span (Str : access VString) return Pattern; function Span (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string cannot be empty , so the pattern fails if the current -- character is not one of the characters in Str. function Succeed return Pattern; -- Constructs a pattern that succeeds matching null, both on the first -- attempt, and on any rematch attempt, i.e. it is equivalent to an -- infinite alternation of null strings. function Tab (Count : Natural) return Pattern; function Tab (Count : access Natural) return Pattern; function Tab (Count : Natural_Func) return Pattern; -- Constructs a pattern that from the current location until Count -- characters have been matched. The pattern fails if more than Count -- characters have already been matched. --------------------------------- -- Pattern Matching Operations -- --------------------------------- -- The Match function performs an actual pattern matching operation. -- The versions with three parameters perform a match without modifying -- the subject string and return a Boolean result indicating if the -- match is successful or not. The Anchor parameter is set to True to -- obtain an anchored match in which the pattern is required to match -- the first character of the string. In an unanchored match, which is -- the default, successive attempts are made to match the given pattern -- at each character of the subject string until a match succeeds, or -- until all possibilities have failed. -- Note that pattern assignment functions in the pattern may generate -- side effects, so these functions are not necessarily pure. Anchored_Mode : Boolean := False; -- This global variable can be set True to cause all subsequent pattern -- matches to operate in anchored mode. In anchored mode, no attempt is -- made to move the anchor point, so that if the match succeeds it must -- succeed starting at the first character. Note that the effect of -- anchored mode may be achieved in individual pattern matches by using -- Fence or Pos(0) at the start of the pattern. Pattern_Stack_Overflow : exception; -- Exception raised if internal pattern matching stack overflows. This -- is typically the result of runaway pattern recursion. If there is a -- genuine case of stack overflow, then either the match must be broken -- down into simpler steps, or the stack limit must be reset. Stack_Size : constant Positive := 2000; -- Size used for internal pattern matching stack. Increase this size if -- complex patterns cause Pattern_Stack_Overflow to be raised. -- Simple match functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. function Match (Subject : VString; Pat : Pattern) return Boolean; function Match (Subject : VString; Pat : PString) return Boolean; function Match (Subject : String; Pat : Pattern) return Boolean; function Match (Subject : String; Pat : PString) return Boolean; -- Replacement functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. -- If the match succeeds, then the matched part of the subject string -- is replaced by the given Replace string. function Match (Subject : VString_Var; Pat : Pattern; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : Pattern; Replace : String) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : String) return Boolean; -- Simple match procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. procedure Match (Subject : VString; Pat : Pattern); procedure Match (Subject : VString; Pat : PString); procedure Match (Subject : String; Pat : Pattern); procedure Match (Subject : String; Pat : PString); -- Replacement procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. If the match succeeds, -- then the matched part of the subject string is replaced by the given -- Replace string. procedure Match (Subject : in out VString; Pat : Pattern; Replace : VString); procedure Match (Subject : in out VString; Pat : PString; Replace : VString); procedure Match (Subject : in out VString; Pat : Pattern; Replace : String); procedure Match (Subject : in out VString; Pat : PString; Replace : String); -- Deferred Replacement type Match_Result is private; -- Type used to record result of pattern match subtype Match_Result_Var is Match_Result; -- This synonyms is used as a formal parameter type to a function where, -- if the language allowed, we would use an in out parameter, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interprete them properly as though they were indeed -- in out parameters. function Match (Subject : VString_Var; Pat : Pattern; Result : Match_Result_Var) return Boolean; procedure Match (Subject : in out VString; Pat : Pattern; Result : out Match_Result); procedure Replace (Result : in out Match_Result; Replace : VString); -- Given a previous call to Match which set Result, performs a pattern -- replacement if the match was successful. Has no effect if the match -- failed. This call should immediately follow the Match call. ------------------------ -- Debugging Routines -- ------------------------ -- Debugging pattern matching operations can often be quite complex, -- since there is no obvious way to trace the progress of the match. -- The declarations in this section provide some debugging assistance. Debug_Mode : Boolean := False; -- This global variable can be set True to generate debugging on all -- subsequent calls to Match. The debugging output is a full trace of -- the actions of the pattern matcher, written to Standard_Output. The -- level of this information is intended to be comprehensible at the -- abstract level of this package declaration. However, note that the -- use of this switch often generates large amounts of output. function "*" (P : Pattern; Fil : File_Access) return Pattern; function "*" (P : PString; Fil : File_Access) return Pattern; function "*" (P : PChar; Fil : File_Access) return Pattern; function "**" (P : Pattern; Fil : File_Access) return Pattern; function "**" (P : PString; Fil : File_Access) return Pattern; function "**" (P : PChar; Fil : File_Access) return Pattern; -- These are similar to the corresponding pattern assignment operations -- except that instead of setting the value of a variable, the matched -- substring is written to the appropriate file. This can be useful in -- following the progress of a match without generating the full amount -- of information obtained by setting Debug_Mode to True. Terminal : constant File_Access := Standard_Error; Output : constant File_Access := Standard_Output; -- Two handy synonyms for use with the above pattern write operations. -- Finally we have some routines that are useful for determining what -- patterns are in use, particularly if they are constructed dynamically. function Image (P : Pattern) return String; function Image (P : Pattern) return VString; -- This procedures yield strings that corresponds to the syntax needed -- to create the given pattern using the functions in this package. The -- form of this string is such that it could actually be compiled and -- evaluated to yield the required pattern except for references to -- variables and functions, which are output using one of the following -- forms: -- -- access Natural NP(16#...#) -- access Pattern PP(16#...#) -- access VString VP(16#...#) -- -- Natural_Func NF(16#...#) -- VString_Func VF(16#...#) -- -- where 16#...# is the hex representation of the integer address that -- corresponds to the given access value procedure Dump (P : Pattern); -- This procedure writes information about the pattern to Standard_Out. -- The format of this information is keyed to the internal data structures -- used to implement patterns. The information provided by Dump is thus -- more precise than that yielded by Image, but is also a bit more obscure -- (i.e. it cannot be interpreted solely in terms of this spec, you have -- to know something about the data structures). ------------------ -- Private Part -- ------------------ private type PE; -- Pattern element, a pattern is a plex structure of PE's. This type -- is defined and sdescribed in the body of this package. type PE_Ptr is access all PE; -- Pattern reference. PE's use PE_Ptr values to reference other PE's type Pattern is new Controlled with record Stk : Natural; -- Maximum number of stack entries required for matching this -- pattern. See description of pattern history stack in body. P : PE_Ptr; -- Pointer to initial pattern element for pattern end record; pragma Finalize_Storage_Only (Pattern); procedure Adjust (Object : in out Pattern); -- Adjust routine used to copy pattern objects procedure Finalize (Object : in out Pattern); -- Finalization routine used to release storage allocated for a pattern. type VString_Ptr is access all VString; type Match_Result is record Var : VString_Ptr; -- Pointer to subject string. Set to null if match failed. Start : Natural; -- Starting index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. Stop : Natural; -- Ending index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. end record; pragma Volatile (Match_Result); -- This ensures that the Result parameter is passed by reference, so -- that we can play our games with the bogus Match_Result_Var parameter -- in the function case to treat it as though it were an in out parameter. end GNAT.Spitbol.Patterns;

46.510373

79

0.614381

9a2fac7c3e44b227fbeed13c1d41596df61aedd5

9,119

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-wwdenu.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-wwdenu.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-wwdenu.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W W D _ E N U M -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.WCh_StW; use System.WCh_StW; with System.WCh_Con; use System.WCh_Con; with Unchecked_Conversion; package body System.WWd_Enum is ----------------------------------- -- Wide_Wide_Width_Enumeration_8 -- ----------------------------------- function Wide_Wide_Width_Enumeration_8 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_8 is range 0 .. 2 ** 7 - 1; type Index_Table is array (Natural) of Natural_8; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_Wide_String := String_To_Wide_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Wide_Width_Enumeration_8; ------------------------------------ -- Wide_Wide_Width_Enumeration_16 -- ------------------------------------ function Wide_Wide_Width_Enumeration_16 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_16 is range 0 .. 2 ** 15 - 1; type Index_Table is array (Natural) of Natural_16; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_Wide_String := String_To_Wide_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Wide_Width_Enumeration_16; ------------------------------------ -- Wide_Wide_Width_Enumeration_32 -- ------------------------------------ function Wide_Wide_Width_Enumeration_32 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_32 is range 0 .. 2 ** 31 - 1; type Index_Table is array (Natural) of Natural_32; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_Wide_String := String_To_Wide_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Wide_Width_Enumeration_32; ------------------------------ -- Wide_Width_Enumeration_8 -- ------------------------------ function Wide_Width_Enumeration_8 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_8 is range 0 .. 2 ** 7 - 1; type Index_Table is array (Natural) of Natural_8; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_String := String_To_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Width_Enumeration_8; ------------------------------- -- Wide_Width_Enumeration_16 -- ------------------------------- function Wide_Width_Enumeration_16 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_16 is range 0 .. 2 ** 15 - 1; type Index_Table is array (Natural) of Natural_16; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_String := String_To_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Width_Enumeration_16; ------------------------------- -- Wide_Width_Enumeration_32 -- ------------------------------- function Wide_Width_Enumeration_32 (Names : String; Indexes : System.Address; Lo, Hi : Natural; EM : WC_Encoding_Method) return Natural is W : Natural; type Natural_32 is range 0 .. 2 ** 31 - 1; type Index_Table is array (Natural) of Natural_32; type Index_Table_Ptr is access Index_Table; function To_Index_Table_Ptr is new Unchecked_Conversion (System.Address, Index_Table_Ptr); IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes); begin W := 0; for J in Lo .. Hi loop declare WS : constant Wide_String := String_To_Wide_String (Names (Natural (IndexesT (J)) .. Natural (IndexesT (J + 1)) - 1), EM); begin W := Natural'Max (W, WS'Length); end; end loop; return W; end Wide_Width_Enumeration_32; end System.WWd_Enum;

34.541667

78

0.505867

38f8d8130a2ccc6092f7e2af20dfa83da33d91b2

3,009

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/prj-part.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/prj-part.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/prj-part.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P R J . P A R T -- -- -- -- S p e c -- -- -- -- Copyright (C) 2000-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Implements the parsing of project files into a tree with Prj.Tree; use Prj.Tree; package Prj.Part is procedure Parse (In_Tree : Project_Node_Tree_Ref; Project : out Project_Node_Id; Project_File_Name : String; Always_Errout_Finalize : Boolean; Packages_To_Check : String_List_Access := All_Packages; Store_Comments : Boolean := False); -- Parse project file and all its imported project files and create a tree. -- Return the node for the project (or Empty_Node if parsing failed). If -- Always_Errout_Finalize is True, Errout.Finalize is called in all cases, -- Otherwise, Errout.Finalize is only called if there are errors (but not -- if there are only warnings). Packages_To_Check indicates the packages -- where any unknown attribute produces an error. For other packages, an -- unknown attribute produces a warning. When Store_Comments is True, -- comments are stored in the parse tree. end Prj.Part;

60.18

79

0.475906

8b7194f2ca5e6a7dccb95cca939018cde69bb812

1,665

ads

Ada

src/flyweights/flyweights_hashtables_spec.ads

jhumphry/auto_counters

bc7dfabf82febd09facf90371c8c11a628a06266

[ "0BSD" ]

5

2016-02-22T10:29:26.000Z

2021-12-18T08:20:12.000Z

src/flyweights/flyweights_hashtables_spec.ads

jhumphry/auto_counters

bc7dfabf82febd09facf90371c8c11a628a06266

[ "0BSD" ]

1

2022-02-16T03:38:08.000Z

2022-02-20T21:11:30.000Z

src/flyweights/flyweights_hashtables_spec.ads

jhumphry/auto_counters

bc7dfabf82febd09facf90371c8c11a628a06266

[ "0BSD" ]

null

-- flyweights_hashtables_spec.ads -- A specification package that summarises the requirements for hashtables -- used in the Flyweights -- Copyright (c) 2016, James Humphry -- -- Permission to use, copy, modify, and/or distribute this software for any -- purpose with or without fee is hereby granted, provided that the above -- copyright notice and this permission notice appear in all copies. -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH -- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY -- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, -- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM -- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE -- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR -- PERFORMANCE OF THIS SOFTWARE. pragma Profile (No_Implementation_Extensions); with Ada.Containers; generic type Element_Access is private; type Flyweight is limited private; with procedure Insert (F : aliased in out Flyweight; Bucket : out Ada.Containers.Hash_Type; Data_Ptr : in out Element_Access); with procedure Increment (F : aliased in out Flyweight; Bucket : in Ada.Containers.Hash_Type; Data_Ptr : in Element_Access); with procedure Remove (F : in out Flyweight; Bucket : in Ada.Containers.Hash_Type; Data_Ptr : in Element_Access); package Flyweights_Hashtables_Spec is end Flyweights_Hashtables_Spec;

43.815789

80

0.705706

2f764a3f311ba8b383768be244fe553af983f051

903

ads

Ada

deps/gid/gid-buffering.ads

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

deps/gid/gid-buffering.ads

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

deps/gid/gid-buffering.ads

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

private package GID.Buffering is -- Attach a buffer to a stream. procedure Attach_Stream( b : out Input_buffer; stm : in Stream_Access ); function Is_stream_attached(b: Input_buffer) return Boolean; -- From the first call to Get_Byte, subsequent bytes must be read -- through Get_Byte as well since the stream is partly read in advance procedure Get_Byte(b: in out Input_buffer; byte: out U8); pragma Inline(Get_Byte); private subtype Size_test_a is Byte_array(1..19); subtype Size_test_b is Ada.Streams.Stream_Element_Array(1..19); -- is_mapping_possible: Compile-time test for checking if -- a Byte_Array is equivalemnt to a Ada.Streams.Stream_Element_Array. -- is_mapping_possible: constant Boolean:= Size_test_a'Size = Size_test_b'Size and Size_test_a'Alignment = Size_test_b'Alignment; end GID.Buffering;

31.137931

74

0.717608

4b2240b4a9ea1afa29f4c3a28c4e6b95618b1df4

4,374

ads

Ada

source/league/ucd/matreshka-internals-unicode-ucd-core_0e01.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_0e01.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_0e01.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2015, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ pragma Restrictions (No_Elaboration_Code); -- GNAT: enforce generation of preinitialized data section instead of -- generation of elaboration code. package Matreshka.Internals.Unicode.Ucd.Core_0E01 is pragma Preelaborate; Group_0E01 : aliased constant Core_Second_Stage := (16#F0# .. 16#FF# => -- 0E01F0 .. 0E01FF (Unassigned, Neutral, Control, Other, Other, Unknown, (Other_Default_Ignorable_Code_Point | Default_Ignorable_Code_Point | Changes_When_NFKC_Casefolded => True, others => False)), others => (Nonspacing_Mark, Ambiguous, Extend, Extend, Extend, Combining_Mark, (Variation_Selector | Case_Ignorable | Default_Ignorable_Code_Point | Grapheme_Extend | ID_Continue | XID_Continue | Changes_When_NFKC_Casefolded => True, others => False))); end Matreshka.Internals.Unicode.Ucd.Core_0E01;

59.108108

78

0.449474

1ec0608189e5eb1449600eb8c0714175239e5145

3,531

adb

Ada

regtests/keystore-tools-tests.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

null

regtests/keystore-tools-tests.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

null

regtests/keystore-tools-tests.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- keystore-tools-tests -- Tests for files -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Directories; with Util.Test_Caller; with Util.Strings; with Keystore.Files; package body Keystore.Tools.Tests is use Ada.Directories; use type Interfaces.Unsigned_64; package Caller is new Util.Test_Caller (Test, "Keystore.Tools"); procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is begin Caller.Add_Test (Suite, "Test Keystore.Files.Create+Open", Test_Store_Directory'Access); end Add_Tests; -- ------------------------------ -- Test storing a directory tree -- ------------------------------ procedure Test_Store_Directory (T : in out Test) is function Filter (Ent : in Directory_Entry_Type) return Boolean; function Filter (Ent : in Directory_Entry_Type) return Boolean is Name : constant String := Ada.Directories.Simple_Name (Ent); Kind : constant File_Kind := Ada.Directories.Kind (Ent); begin if Kind = Ada.Directories.Ordinary_File then return Util.Strings.Ends_With (Name, ".ads"); else return Name /= ".git" and Name /= "result"; end if; end Filter; Path : constant String := Util.Tests.Get_Test_Path ("regtests/result/test-store.akt"); Password : Keystore.Secret_Key := Keystore.Create ("mypassword"); Config : Keystore.Wallet_Config := Unsecure_Config; begin declare W : Keystore.Files.Wallet_File; begin Config.Overwrite := True; W.Create (Path => Path, Password => Password, Config => Config); Keystore.Tools.Store (Wallet => W, Path => ".", Prefix => "store/", Pattern => "*", Filter => Filter'Access); end; declare procedure Check (Name : in String); W : Keystore.Files.Wallet_File; procedure Check (Name : in String) is Item : Keystore.Entry_Info; begin Item := W.Find (Name); T.Assert (Item.Size > 8192, "Invalid item size for " & Name); T.Assert (Item.Size < 128 * 1024, "Invalid item size for " & Name); T.Assert (Item.Block_Count > 2, "Invalid item for " & Name); T.Assert (Item.Kind = T_FILE, "Invalid item type for " & Name); end Check; begin W.Open (Password => Password, Path => Path); Check ("store/src/keystore.ads"); Check ("store/src/keystore-repository.ads"); Check ("store/obj/b__akt-main.ads"); end; end Test_Store_Directory; end Keystore.Tools.Tests;

38.380435

96

0.576041

a0807b656fa6bdf5ccc6598a2acbebf94cf591b5

2,495

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/gnat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/gnat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

13

2018-10-12T21:29:09.000Z

2018-10-25T20:06:51.000Z

gcc-gcc-7_3_0-release/gcc/ada/gnat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2014, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the parent package for a library of useful units provided with GNAT package GNAT is pragma Pure; end GNAT;

65.657895

79

0.372345

9a5804cad1a959a4a713b58ca2f7f3b6a91c9572

5,758

adb

Ada

source/tasking/machine-w64-mingw32/s-nattas.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/tasking/machine-w64-mingw32/s-nattas.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/tasking/machine-w64-mingw32/s-nattas.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

with Ada.Unchecked_Conversion; with System.Storage_Map; with C.basetsd; with C.winternl; package body System.Native_Tasks is use type C.char_array; use type C.windef.DWORD; use type C.windef.WINBOOL; use type C.winnt.HANDLE; -- C.void_ptr type struct_THREAD_BASIC_INFORMATION is record ExitStatus : C.winternl.NTSTATUS; TebBaseAddress : C.winnt.struct_TEB_ptr; -- PVOID; ClientId : C.winternl.CLIENT_ID; AffinityMask : C.basetsd.KAFFINITY; Priority : C.winternl.KPRIORITY; BasePriority : C.winternl.KPRIORITY; end record with Convention => C; pragma Suppress_Initialization (struct_THREAD_BASIC_INFORMATION); type NtQueryInformationThread_Type is access function ( ThreadHandle : C.winnt.HANDLE; ThreadInformationClass : C.winternl.THREADINFOCLASS; ThreadInformation : C.winnt.PVOID; ThreadInformationLength : C.windef.ULONG; ReturnLength : access C.windef.ULONG) return C.winternl.NTSTATUS with Convention => WINAPI; NtQueryInformationThread_Name : constant C.char_array (0 .. 24) := "NtQueryInformationThread" & C.char'Val (0); procedure Nop is null; Installed_Abort_Handler : not null Abort_Handler := Nop'Access; -- implementation of thread procedure Create ( Handle : aliased out Handle_Type; Parameter : Parameter_Type; Thread_Body : Thread_Body_Type; Error : out Boolean) is Id : aliased C.windef.DWORD; begin Handle := C.winbase.CreateThread ( lpThreadAttributes => null, dwStackSize => 0, lpStartAddress => Thread_Body, lpParameter => Parameter, dwCreationFlags => 0, lpThreadId => Id'Access); Error := Handle = C.winbase.INVALID_HANDLE_VALUE; end Create; procedure Join ( Handle : Handle_Type; Current_Abort_Event : access Synchronous_Objects.Event; Result : aliased out Result_Type; Error : out Boolean) is Signaled : C.windef.DWORD; begin Error := False; if Current_Abort_Event /= null then declare Handles : aliased array (0 .. 1) of aliased C.winnt.HANDLE := (Handle, Synchronous_Objects.Handle (Current_Abort_Event.all)); begin Signaled := C.winbase.WaitForMultipleObjects ( 2, Handles (0)'Access, 0, C.winbase.INFINITE); if Signaled /= C.winbase.WAIT_OBJECT_0 + 1 then goto Done; end if; Installed_Abort_Handler.all; -- may abort child tasks end; end if; Signaled := C.winbase.WaitForSingleObject (Handle, C.winbase.INFINITE); <<Done>> case Signaled is when C.winbase.WAIT_OBJECT_0 => if C.winbase.GetExitCodeThread (Handle, Result'Access) = C.windef.FALSE then Error := True; end if; when others => Error := True; end case; if C.winbase.CloseHandle (Handle) = C.windef.FALSE then Error := True; end if; end Join; procedure Detach ( Handle : in out Handle_Type; Error : out Boolean) is begin Error := False; if C.winbase.CloseHandle (Handle) = C.windef.FALSE then Error := True; else Handle := C.winbase.GetCurrentThread; -- magic value meaning current thread pragma Assert ( Handle = C.winnt.HANDLE (System'To_Address (16#fffffffe#))); end if; end Detach; -- implementation of stack function Info_Block (Handle : Handle_Type) return C.winnt.struct_TEB_ptr is function To_NtQueryInformationThread_Type is new Ada.Unchecked_Conversion ( C.windef.FARPROC, NtQueryInformationThread_Type); NtQueryInformationThread : NtQueryInformationThread_Type; begin NtQueryInformationThread := To_NtQueryInformationThread_Type ( C.winbase.GetProcAddress ( Storage_Map.NTDLL, NtQueryInformationThread_Name (0)'Access)); if NtQueryInformationThread = null then return null; -- ??? else declare TBI : aliased struct_THREAD_BASIC_INFORMATION; ReturnLength : aliased C.windef.ULONG; Dummy_Status : C.winternl.NTSTATUS; begin Dummy_Status := NtQueryInformationThread ( Handle, C.winternl.ThreadBasicInformation, C.windef.LPVOID (TBI'Address), struct_THREAD_BASIC_INFORMATION'Size / Standard'Storage_Unit, ReturnLength'Access); return TBI.TebBaseAddress; end; end if; end Info_Block; -- implementation of signals procedure Install_Abort_Handler (Handler : Abort_Handler) is begin Installed_Abort_Handler := Handler; end Install_Abort_Handler; procedure Uninstall_Abort_Handler is begin Installed_Abort_Handler := Nop'Access; end Uninstall_Abort_Handler; procedure Send_Abort_Signal ( Handle : Handle_Type; Abort_Event : in out Synchronous_Objects.Event; Error : out Boolean) is pragma Unreferenced (Handle); begin Synchronous_Objects.Set (Abort_Event); Error := False; end Send_Abort_Signal; procedure Block_Abort_Signal (Abort_Event : Synchronous_Objects.Event) is begin -- check aborted if Synchronous_Objects.Get (Abort_Event) then Installed_Abort_Handler.all; end if; end Block_Abort_Signal; procedure Yield is begin C.winbase.Sleep (0); end Yield; end System.Native_Tasks;

30.956989

78

0.633553

ad2562ad75faabd34084dc8ec1a8aeb08175ae43

26,597

ads

Ada

Practica 03/Planificador_Ciclico_Sin_Prioridades/obj/b__planificador_ciclico_sin_prioridades.ads

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/Planificador_Ciclico_Sin_Prioridades/obj/b__planificador_ciclico_sin_prioridades.ads

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/Planificador_Ciclico_Sin_Prioridades/obj/b__planificador_ciclico_sin_prioridades.ads

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

1

2022-03-06T17:37:39.000Z

pragma Warnings (Off); pragma Ada_95; with System; with System.Parameters; with System.Secondary_Stack; package ada_main is gnat_argc : Integer; gnat_argv : System.Address; gnat_envp : System.Address; pragma Import (C, gnat_argc); pragma Import (C, gnat_argv); pragma Import (C, gnat_envp); gnat_exit_status : Integer; pragma Import (C, gnat_exit_status); GNAT_Version : constant String := "GNAT Version: Community 2020 (20200429-93)" & ASCII.NUL; pragma Export (C, GNAT_Version, "__gnat_version"); Ada_Main_Program_Name : constant String := "_ada_planificador_ciclico_sin_prioridades" & ASCII.NUL; pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name"); procedure adainit; pragma Export (C, adainit, "adainit"); procedure adafinal; pragma Export (C, adafinal, "adafinal"); function main (argc : Integer; argv : System.Address; envp : System.Address) return Integer; pragma Export (C, main, "main"); type Version_32 is mod 2 ** 32; u00001 : constant Version_32 := 16#d185551d#; pragma Export (C, u00001, "planificador_ciclico_sin_prioridadesB"); u00002 : constant Version_32 := 16#67c8d842#; pragma Export (C, u00002, "system__standard_libraryB"); u00003 : constant Version_32 := 16#5741b5a5#; pragma Export (C, u00003, "system__standard_libraryS"); u00004 : constant Version_32 := 16#76789da1#; pragma Export (C, u00004, "adaS"); u00005 : constant Version_32 := 16#57c21ad4#; pragma Export (C, u00005, "ada__calendarB"); u00006 : constant Version_32 := 16#31350a81#; pragma Export (C, u00006, "ada__calendarS"); u00007 : constant Version_32 := 16#f34ff985#; pragma Export (C, u00007, "ada__exceptionsB"); u00008 : constant Version_32 := 16#cfbb5cc5#; pragma Export (C, u00008, "ada__exceptionsS"); u00009 : constant Version_32 := 16#35e1815f#; pragma Export (C, u00009, "ada__exceptions__last_chance_handlerB"); u00010 : constant Version_32 := 16#cfec26ee#; pragma Export (C, u00010, "ada__exceptions__last_chance_handlerS"); u00011 : constant Version_32 := 16#32a08138#; pragma Export (C, u00011, "systemS"); u00012 : constant Version_32 := 16#ae860117#; pragma Export (C, u00012, "system__soft_linksB"); u00013 : constant Version_32 := 16#4d9536d3#; pragma Export (C, u00013, "system__soft_linksS"); u00014 : constant Version_32 := 16#59d61025#; pragma Export (C, u00014, "system__secondary_stackB"); u00015 : constant Version_32 := 16#c30bb6bc#; pragma Export (C, u00015, "system__secondary_stackS"); u00016 : constant Version_32 := 16#896564a3#; pragma Export (C, u00016, "system__parametersB"); u00017 : constant Version_32 := 16#75f245f3#; pragma Export (C, u00017, "system__parametersS"); u00018 : constant Version_32 := 16#ced09590#; pragma Export (C, u00018, "system__storage_elementsB"); u00019 : constant Version_32 := 16#1f63cb3c#; pragma Export (C, u00019, "system__storage_elementsS"); u00020 : constant Version_32 := 16#ce3e0e21#; pragma Export (C, u00020, "system__soft_links__initializeB"); u00021 : constant Version_32 := 16#5697fc2b#; pragma Export (C, u00021, "system__soft_links__initializeS"); u00022 : constant Version_32 := 16#41837d1e#; pragma Export (C, u00022, "system__stack_checkingB"); u00023 : constant Version_32 := 16#bc1fead0#; pragma Export (C, u00023, "system__stack_checkingS"); u00024 : constant Version_32 := 16#34742901#; pragma Export (C, u00024, "system__exception_tableB"); u00025 : constant Version_32 := 16#0dc9c2c8#; pragma Export (C, u00025, "system__exception_tableS"); u00026 : constant Version_32 := 16#ce4af020#; pragma Export (C, u00026, "system__exceptionsB"); u00027 : constant Version_32 := 16#5ac3ecce#; pragma Export (C, u00027, "system__exceptionsS"); u00028 : constant Version_32 := 16#69416224#; pragma Export (C, u00028, "system__exceptions__machineB"); u00029 : constant Version_32 := 16#5c74e542#; pragma Export (C, u00029, "system__exceptions__machineS"); u00030 : constant Version_32 := 16#aa0563fc#; pragma Export (C, u00030, "system__exceptions_debugB"); u00031 : constant Version_32 := 16#2eed524e#; pragma Export (C, u00031, "system__exceptions_debugS"); u00032 : constant Version_32 := 16#6c2f8802#; pragma Export (C, u00032, "system__img_intB"); u00033 : constant Version_32 := 16#307b61fa#; pragma Export (C, u00033, "system__img_intS"); u00034 : constant Version_32 := 16#39df8c17#; pragma Export (C, u00034, "system__tracebackB"); u00035 : constant Version_32 := 16#6c825ffc#; pragma Export (C, u00035, "system__tracebackS"); u00036 : constant Version_32 := 16#9ed49525#; pragma Export (C, u00036, "system__traceback_entriesB"); u00037 : constant Version_32 := 16#32fb7748#; pragma Export (C, u00037, "system__traceback_entriesS"); u00038 : constant Version_32 := 16#3f39e75e#; pragma Export (C, u00038, "system__traceback__symbolicB"); u00039 : constant Version_32 := 16#46491211#; pragma Export (C, u00039, "system__traceback__symbolicS"); u00040 : constant Version_32 := 16#179d7d28#; pragma Export (C, u00040, "ada__containersS"); u00041 : constant Version_32 := 16#701f9d88#; pragma Export (C, u00041, "ada__exceptions__tracebackB"); u00042 : constant Version_32 := 16#ae2d2db5#; pragma Export (C, u00042, "ada__exceptions__tracebackS"); u00043 : constant Version_32 := 16#e865e681#; pragma Export (C, u00043, "system__bounded_stringsB"); u00044 : constant Version_32 := 16#455da021#; pragma Export (C, u00044, "system__bounded_stringsS"); u00045 : constant Version_32 := 16#7b499e82#; pragma Export (C, u00045, "system__crtlS"); u00046 : constant Version_32 := 16#641e2245#; pragma Export (C, u00046, "system__dwarf_linesB"); u00047 : constant Version_32 := 16#40ce1ea3#; pragma Export (C, u00047, "system__dwarf_linesS"); u00048 : constant Version_32 := 16#5b4659fa#; pragma Export (C, u00048, "ada__charactersS"); u00049 : constant Version_32 := 16#8f637df8#; pragma Export (C, u00049, "ada__characters__handlingB"); u00050 : constant Version_32 := 16#3b3f6154#; pragma Export (C, u00050, "ada__characters__handlingS"); u00051 : constant Version_32 := 16#4b7bb96a#; pragma Export (C, u00051, "ada__characters__latin_1S"); u00052 : constant Version_32 := 16#e6d4fa36#; pragma Export (C, u00052, "ada__stringsS"); u00053 : constant Version_32 := 16#96df1a3f#; pragma Export (C, u00053, "ada__strings__mapsB"); u00054 : constant Version_32 := 16#1e526bec#; pragma Export (C, u00054, "ada__strings__mapsS"); u00055 : constant Version_32 := 16#465aa89c#; pragma Export (C, u00055, "system__bit_opsB"); u00056 : constant Version_32 := 16#0765e3a3#; pragma Export (C, u00056, "system__bit_opsS"); u00057 : constant Version_32 := 16#6c6ff32a#; pragma Export (C, u00057, "system__unsigned_typesS"); u00058 : constant Version_32 := 16#92f05f13#; pragma Export (C, u00058, "ada__strings__maps__constantsS"); u00059 : constant Version_32 := 16#5ab55268#; pragma Export (C, u00059, "interfacesS"); u00060 : constant Version_32 := 16#a0d3d22b#; pragma Export (C, u00060, "system__address_imageB"); u00061 : constant Version_32 := 16#934c1c02#; pragma Export (C, u00061, "system__address_imageS"); u00062 : constant Version_32 := 16#8631cc2e#; pragma Export (C, u00062, "system__img_unsB"); u00063 : constant Version_32 := 16#f39bcfdd#; pragma Export (C, u00063, "system__img_unsS"); u00064 : constant Version_32 := 16#20ec7aa3#; pragma Export (C, u00064, "system__ioB"); u00065 : constant Version_32 := 16#ace27677#; pragma Export (C, u00065, "system__ioS"); u00066 : constant Version_32 := 16#3080f2ca#; pragma Export (C, u00066, "system__mmapB"); u00067 : constant Version_32 := 16#9ad4d587#; pragma Export (C, u00067, "system__mmapS"); u00068 : constant Version_32 := 16#92d882c5#; pragma Export (C, u00068, "ada__io_exceptionsS"); u00069 : constant Version_32 := 16#a8ba7b3b#; pragma Export (C, u00069, "system__mmap__os_interfaceB"); u00070 : constant Version_32 := 16#8f4541b8#; pragma Export (C, u00070, "system__mmap__os_interfaceS"); u00071 : constant Version_32 := 16#657efc5a#; pragma Export (C, u00071, "system__os_libB"); u00072 : constant Version_32 := 16#d872da39#; pragma Export (C, u00072, "system__os_libS"); u00073 : constant Version_32 := 16#ec4d5631#; pragma Export (C, u00073, "system__case_utilB"); u00074 : constant Version_32 := 16#0d75376c#; pragma Export (C, u00074, "system__case_utilS"); u00075 : constant Version_32 := 16#2a8e89ad#; pragma Export (C, u00075, "system__stringsB"); u00076 : constant Version_32 := 16#52b6adad#; pragma Export (C, u00076, "system__stringsS"); u00077 : constant Version_32 := 16#e49bce3e#; pragma Export (C, u00077, "interfaces__cB"); u00078 : constant Version_32 := 16#dbc36ce0#; pragma Export (C, u00078, "interfaces__cS"); u00079 : constant Version_32 := 16#c83ab8ef#; pragma Export (C, u00079, "system__object_readerB"); u00080 : constant Version_32 := 16#f6d45c39#; pragma Export (C, u00080, "system__object_readerS"); u00081 : constant Version_32 := 16#914b0305#; pragma Export (C, u00081, "system__val_lliB"); u00082 : constant Version_32 := 16#5ece13c8#; pragma Export (C, u00082, "system__val_lliS"); u00083 : constant Version_32 := 16#d2ae2792#; pragma Export (C, u00083, "system__val_lluB"); u00084 : constant Version_32 := 16#01a17ec8#; pragma Export (C, u00084, "system__val_lluS"); u00085 : constant Version_32 := 16#269742a9#; pragma Export (C, u00085, "system__val_utilB"); u00086 : constant Version_32 := 16#9e0037c6#; pragma Export (C, u00086, "system__val_utilS"); u00087 : constant Version_32 := 16#b578159b#; pragma Export (C, u00087, "system__exception_tracesB"); u00088 : constant Version_32 := 16#167fa1a2#; pragma Export (C, u00088, "system__exception_tracesS"); u00089 : constant Version_32 := 16#e1282880#; pragma Export (C, u00089, "system__win32S"); u00090 : constant Version_32 := 16#8c33a517#; pragma Export (C, u00090, "system__wch_conB"); u00091 : constant Version_32 := 16#29dda3ea#; pragma Export (C, u00091, "system__wch_conS"); u00092 : constant Version_32 := 16#9721e840#; pragma Export (C, u00092, "system__wch_stwB"); u00093 : constant Version_32 := 16#04cc8feb#; pragma Export (C, u00093, "system__wch_stwS"); u00094 : constant Version_32 := 16#a831679c#; pragma Export (C, u00094, "system__wch_cnvB"); u00095 : constant Version_32 := 16#266a1919#; pragma Export (C, u00095, "system__wch_cnvS"); u00096 : constant Version_32 := 16#ece6fdb6#; pragma Export (C, u00096, "system__wch_jisB"); u00097 : constant Version_32 := 16#a61a0038#; pragma Export (C, u00097, "system__wch_jisS"); u00098 : constant Version_32 := 16#24ec69e6#; pragma Export (C, u00098, "system__os_primitivesB"); u00099 : constant Version_32 := 16#355de4ce#; pragma Export (C, u00099, "system__os_primitivesS"); u00100 : constant Version_32 := 16#05c60a38#; pragma Export (C, u00100, "system__task_lockB"); u00101 : constant Version_32 := 16#532ab656#; pragma Export (C, u00101, "system__task_lockS"); u00102 : constant Version_32 := 16#b8c476a4#; pragma Export (C, u00102, "system__win32__extS"); u00103 : constant Version_32 := 16#ffaa9e94#; pragma Export (C, u00103, "ada__calendar__delaysB"); u00104 : constant Version_32 := 16#d86d2f1d#; pragma Export (C, u00104, "ada__calendar__delaysS"); u00105 : constant Version_32 := 16#553ad4ac#; pragma Export (C, u00105, "ada__real_timeB"); u00106 : constant Version_32 := 16#1ad7dfc0#; pragma Export (C, u00106, "ada__real_timeS"); u00107 : constant Version_32 := 16#0d140719#; pragma Export (C, u00107, "system__taskingB"); u00108 : constant Version_32 := 16#c6674d66#; pragma Export (C, u00108, "system__taskingS"); u00109 : constant Version_32 := 16#dc410cef#; pragma Export (C, u00109, "system__task_primitivesS"); u00110 : constant Version_32 := 16#4cfe4fc8#; pragma Export (C, u00110, "system__os_interfaceS"); u00111 : constant Version_32 := 16#1d638357#; pragma Export (C, u00111, "interfaces__c__stringsB"); u00112 : constant Version_32 := 16#f239f79c#; pragma Export (C, u00112, "interfaces__c__stringsS"); u00113 : constant Version_32 := 16#152ee045#; pragma Export (C, u00113, "system__task_primitives__operationsB"); u00114 : constant Version_32 := 16#5a0b0d58#; pragma Export (C, u00114, "system__task_primitives__operationsS"); u00115 : constant Version_32 := 16#1b28662b#; pragma Export (C, u00115, "system__float_controlB"); u00116 : constant Version_32 := 16#d25cc204#; pragma Export (C, u00116, "system__float_controlS"); u00117 : constant Version_32 := 16#6387a759#; pragma Export (C, u00117, "system__interrupt_managementB"); u00118 : constant Version_32 := 16#246e2885#; pragma Export (C, u00118, "system__interrupt_managementS"); u00119 : constant Version_32 := 16#64507e17#; pragma Export (C, u00119, "system__multiprocessorsB"); u00120 : constant Version_32 := 16#0a0c1e4b#; pragma Export (C, u00120, "system__multiprocessorsS"); u00121 : constant Version_32 := 16#ce7dfb56#; pragma Export (C, u00121, "system__task_infoB"); u00122 : constant Version_32 := 16#4713b9b1#; pragma Export (C, u00122, "system__task_infoS"); u00123 : constant Version_32 := 16#1bbc5086#; pragma Export (C, u00123, "system__tasking__debugB"); u00124 : constant Version_32 := 16#48f9280e#; pragma Export (C, u00124, "system__tasking__debugS"); u00125 : constant Version_32 := 16#fd83e873#; pragma Export (C, u00125, "system__concat_2B"); u00126 : constant Version_32 := 16#300056e8#; pragma Export (C, u00126, "system__concat_2S"); u00127 : constant Version_32 := 16#2b70b149#; pragma Export (C, u00127, "system__concat_3B"); u00128 : constant Version_32 := 16#39d0dd9d#; pragma Export (C, u00128, "system__concat_3S"); u00129 : constant Version_32 := 16#b31a5821#; pragma Export (C, u00129, "system__img_enum_newB"); u00130 : constant Version_32 := 16#53ec87f8#; pragma Export (C, u00130, "system__img_enum_newS"); u00131 : constant Version_32 := 16#617d5887#; pragma Export (C, u00131, "system__stack_usageB"); u00132 : constant Version_32 := 16#3a3ac346#; pragma Export (C, u00132, "system__stack_usageS"); u00133 : constant Version_32 := 16#f9576a72#; pragma Export (C, u00133, "ada__tagsB"); u00134 : constant Version_32 := 16#b6661f55#; pragma Export (C, u00134, "ada__tagsS"); u00135 : constant Version_32 := 16#796f31f1#; pragma Export (C, u00135, "system__htableB"); u00136 : constant Version_32 := 16#b66232d2#; pragma Export (C, u00136, "system__htableS"); u00137 : constant Version_32 := 16#089f5cd0#; pragma Export (C, u00137, "system__string_hashB"); u00138 : constant Version_32 := 16#143c59ac#; pragma Export (C, u00138, "system__string_hashS"); u00139 : constant Version_32 := 16#f4e097a7#; pragma Export (C, u00139, "ada__text_ioB"); u00140 : constant Version_32 := 16#03e83e15#; pragma Export (C, u00140, "ada__text_ioS"); u00141 : constant Version_32 := 16#10558b11#; pragma Export (C, u00141, "ada__streamsB"); u00142 : constant Version_32 := 16#67e31212#; pragma Export (C, u00142, "ada__streamsS"); u00143 : constant Version_32 := 16#73d2d764#; pragma Export (C, u00143, "interfaces__c_streamsB"); u00144 : constant Version_32 := 16#b1330297#; pragma Export (C, u00144, "interfaces__c_streamsS"); u00145 : constant Version_32 := 16#ec9c64c3#; pragma Export (C, u00145, "system__file_ioB"); u00146 : constant Version_32 := 16#95d1605d#; pragma Export (C, u00146, "system__file_ioS"); u00147 : constant Version_32 := 16#86c56e5a#; pragma Export (C, u00147, "ada__finalizationS"); u00148 : constant Version_32 := 16#95817ed8#; pragma Export (C, u00148, "system__finalization_rootB"); u00149 : constant Version_32 := 16#7d52f2a8#; pragma Export (C, u00149, "system__finalization_rootS"); u00150 : constant Version_32 := 16#cf3f1b90#; pragma Export (C, u00150, "system__file_control_blockS"); u00151 : constant Version_32 := 16#932a4690#; pragma Export (C, u00151, "system__concat_4B"); u00152 : constant Version_32 := 16#4cc4aa18#; pragma Export (C, u00152, "system__concat_4S"); u00153 : constant Version_32 := 16#276453b7#; pragma Export (C, u00153, "system__img_lldB"); u00154 : constant Version_32 := 16#c1828851#; pragma Export (C, u00154, "system__img_lldS"); u00155 : constant Version_32 := 16#bd3715ff#; pragma Export (C, u00155, "system__img_decB"); u00156 : constant Version_32 := 16#9c8d88e3#; pragma Export (C, u00156, "system__img_decS"); u00157 : constant Version_32 := 16#9dca6636#; pragma Export (C, u00157, "system__img_lliB"); u00158 : constant Version_32 := 16#23efd4e9#; pragma Export (C, u00158, "system__img_lliS"); u00159 : constant Version_32 := 16#72e59739#; pragma Export (C, u00159, "system__tasking__rendezvousB"); u00160 : constant Version_32 := 16#e93c6c5f#; pragma Export (C, u00160, "system__tasking__rendezvousS"); u00161 : constant Version_32 := 16#100eaf58#; pragma Export (C, u00161, "system__restrictionsB"); u00162 : constant Version_32 := 16#dbc9df38#; pragma Export (C, u00162, "system__restrictionsS"); u00163 : constant Version_32 := 16#4cd3ce3b#; pragma Export (C, u00163, "system__tasking__entry_callsB"); u00164 : constant Version_32 := 16#526fb901#; pragma Export (C, u00164, "system__tasking__entry_callsS"); u00165 : constant Version_32 := 16#b19e9df1#; pragma Export (C, u00165, "system__tasking__initializationB"); u00166 : constant Version_32 := 16#cd0eb8a9#; pragma Export (C, u00166, "system__tasking__initializationS"); u00167 : constant Version_32 := 16#215cb8f4#; pragma Export (C, u00167, "system__soft_links__taskingB"); u00168 : constant Version_32 := 16#e939497e#; pragma Export (C, u00168, "system__soft_links__taskingS"); u00169 : constant Version_32 := 16#3880736e#; pragma Export (C, u00169, "ada__exceptions__is_null_occurrenceB"); u00170 : constant Version_32 := 16#6fde25af#; pragma Export (C, u00170, "ada__exceptions__is_null_occurrenceS"); u00171 : constant Version_32 := 16#d798575d#; pragma Export (C, u00171, "system__tasking__task_attributesB"); u00172 : constant Version_32 := 16#7dbadc03#; pragma Export (C, u00172, "system__tasking__task_attributesS"); u00173 : constant Version_32 := 16#3af67f9c#; pragma Export (C, u00173, "system__tasking__protected_objectsB"); u00174 : constant Version_32 := 16#242da0e0#; pragma Export (C, u00174, "system__tasking__protected_objectsS"); u00175 : constant Version_32 := 16#119b2d0b#; pragma Export (C, u00175, "system__tasking__protected_objects__entriesB"); u00176 : constant Version_32 := 16#7daf93e7#; pragma Export (C, u00176, "system__tasking__protected_objects__entriesS"); u00177 : constant Version_32 := 16#ad55c617#; pragma Export (C, u00177, "system__tasking__protected_objects__operationsB"); u00178 : constant Version_32 := 16#343fde45#; pragma Export (C, u00178, "system__tasking__protected_objects__operationsS"); u00179 : constant Version_32 := 16#db326703#; pragma Export (C, u00179, "system__tasking__queuingB"); u00180 : constant Version_32 := 16#73e13001#; pragma Export (C, u00180, "system__tasking__queuingS"); u00181 : constant Version_32 := 16#1d9c679e#; pragma Export (C, u00181, "system__tasking__utilitiesB"); u00182 : constant Version_32 := 16#a65de031#; pragma Export (C, u00182, "system__tasking__utilitiesS"); u00183 : constant Version_32 := 16#7d29cee1#; pragma Export (C, u00183, "system__tasking__stagesB"); u00184 : constant Version_32 := 16#6153a6f3#; pragma Export (C, u00184, "system__tasking__stagesS"); u00185 : constant Version_32 := 16#eca5ecae#; pragma Export (C, u00185, "system__memoryB"); u00186 : constant Version_32 := 16#6bdde70c#; pragma Export (C, u00186, "system__memoryS"); -- BEGIN ELABORATION ORDER -- ada%s -- ada.characters%s -- ada.characters.latin_1%s -- interfaces%s -- system%s -- system.float_control%s -- system.float_control%b -- system.img_enum_new%s -- system.img_enum_new%b -- system.img_int%s -- system.img_int%b -- system.img_dec%s -- system.img_dec%b -- system.img_lli%s -- system.img_lli%b -- system.img_lld%s -- system.img_lld%b -- system.io%s -- system.io%b -- system.parameters%s -- system.parameters%b -- system.crtl%s -- interfaces.c_streams%s -- interfaces.c_streams%b -- system.restrictions%s -- system.restrictions%b -- system.storage_elements%s -- system.storage_elements%b -- system.stack_checking%s -- system.stack_checking%b -- system.stack_usage%s -- system.stack_usage%b -- system.string_hash%s -- system.string_hash%b -- system.htable%s -- system.htable%b -- system.strings%s -- system.strings%b -- system.traceback_entries%s -- system.traceback_entries%b -- system.unsigned_types%s -- system.img_uns%s -- system.img_uns%b -- system.wch_con%s -- system.wch_con%b -- system.wch_jis%s -- system.wch_jis%b -- system.wch_cnv%s -- system.wch_cnv%b -- system.concat_2%s -- system.concat_2%b -- system.concat_3%s -- system.concat_3%b -- system.concat_4%s -- system.concat_4%b -- system.traceback%s -- system.traceback%b -- ada.characters.handling%s -- system.case_util%s -- system.os_lib%s -- system.secondary_stack%s -- system.standard_library%s -- ada.exceptions%s -- system.exceptions_debug%s -- system.exceptions_debug%b -- system.soft_links%s -- system.val_lli%s -- system.val_llu%s -- system.val_util%s -- system.val_util%b -- system.wch_stw%s -- system.wch_stw%b -- ada.exceptions.last_chance_handler%s -- ada.exceptions.last_chance_handler%b -- ada.exceptions.traceback%s -- ada.exceptions.traceback%b -- system.address_image%s -- system.address_image%b -- system.bit_ops%s -- system.bit_ops%b -- system.bounded_strings%s -- system.bounded_strings%b -- system.case_util%b -- system.exception_table%s -- system.exception_table%b -- ada.containers%s -- ada.io_exceptions%s -- ada.strings%s -- ada.strings.maps%s -- ada.strings.maps%b -- ada.strings.maps.constants%s -- interfaces.c%s -- interfaces.c%b -- system.exceptions%s -- system.exceptions%b -- system.exceptions.machine%s -- system.exceptions.machine%b -- system.win32%s -- ada.characters.handling%b -- system.exception_traces%s -- system.exception_traces%b -- system.memory%s -- system.memory%b -- system.mmap%s -- system.mmap.os_interface%s -- system.mmap.os_interface%b -- system.mmap%b -- system.object_reader%s -- system.object_reader%b -- system.dwarf_lines%s -- system.dwarf_lines%b -- system.os_lib%b -- system.secondary_stack%b -- system.soft_links.initialize%s -- system.soft_links.initialize%b -- system.soft_links%b -- system.standard_library%b -- system.traceback.symbolic%s -- system.traceback.symbolic%b -- ada.exceptions%b -- system.val_lli%b -- system.val_llu%b -- ada.exceptions.is_null_occurrence%s -- ada.exceptions.is_null_occurrence%b -- ada.tags%s -- ada.tags%b -- ada.streams%s -- ada.streams%b -- interfaces.c.strings%s -- interfaces.c.strings%b -- system.file_control_block%s -- system.finalization_root%s -- system.finalization_root%b -- ada.finalization%s -- system.file_io%s -- system.file_io%b -- system.multiprocessors%s -- system.multiprocessors%b -- system.os_interface%s -- system.interrupt_management%s -- system.interrupt_management%b -- system.task_info%s -- system.task_info%b -- system.task_lock%s -- system.task_lock%b -- system.task_primitives%s -- system.win32.ext%s -- system.os_primitives%s -- system.os_primitives%b -- system.tasking%s -- system.task_primitives.operations%s -- system.tasking.debug%s -- system.tasking.debug%b -- system.task_primitives.operations%b -- system.tasking%b -- ada.calendar%s -- ada.calendar%b -- ada.calendar.delays%s -- ada.calendar.delays%b -- ada.real_time%s -- ada.real_time%b -- ada.text_io%s -- ada.text_io%b -- system.soft_links.tasking%s -- system.soft_links.tasking%b -- system.tasking.initialization%s -- system.tasking.task_attributes%s -- system.tasking.task_attributes%b -- system.tasking.initialization%b -- system.tasking.protected_objects%s -- system.tasking.protected_objects%b -- system.tasking.protected_objects.entries%s -- system.tasking.protected_objects.entries%b -- system.tasking.queuing%s -- system.tasking.queuing%b -- system.tasking.utilities%s -- system.tasking.utilities%b -- system.tasking.entry_calls%s -- system.tasking.rendezvous%s -- system.tasking.protected_objects.operations%s -- system.tasking.protected_objects.operations%b -- system.tasking.entry_calls%b -- system.tasking.rendezvous%b -- system.tasking.stages%s -- system.tasking.stages%b -- planificador_ciclico_sin_prioridades%b -- END ELABORATION ORDER end ada_main;

44.107794

103

0.682521

1e8e2b2d2aa66f1882ea1629d9d9e4efbedc11e3

6,563

adb

Ada

tools-src/gnu/gcc/gcc/ada/a-wtcoau.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/a-wtcoau.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/a-wtcoau.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- A D A . W I D E _ T E X T _ I O . C O M P L E X _ A U X -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Wide_Text_IO.Generic_Aux; use Ada.Wide_Text_IO.Generic_Aux; with Ada.Wide_Text_IO.Float_Aux; with System.Img_Real; use System.Img_Real; package body Ada.Wide_Text_IO.Complex_Aux is package Aux renames Ada.Wide_Text_IO.Float_Aux; --------- -- Get -- --------- procedure Get (File : in File_Type; ItemR : out Long_Long_Float; ItemI : out Long_Long_Float; Width : Field) is Buf : String (1 .. Field'Last); Stop : Integer := 0; Ptr : aliased Integer; Paren : Boolean := False; begin -- General note for following code, exceptions from the calls -- to Get for components of the complex value are propagated. if Width /= 0 then Load_Width (File, Width, Buf, Stop); Gets (Buf (1 .. Stop), ItemR, ItemI, Ptr); for J in Ptr + 1 .. Stop loop if not Is_Blank (Buf (J)) then raise Data_Error; end if; end loop; -- Case of width = 0 else Load_Skip (File); Ptr := 0; Load (File, Buf, Ptr, '(', Paren); Aux.Get (File, ItemR, 0); Load_Skip (File); Load (File, Buf, Ptr, ','); Aux.Get (File, ItemI, 0); if Paren then Load_Skip (File); Load (File, Buf, Ptr, ')', Paren); if not Paren then raise Data_Error; end if; end if; end if; end Get; ---------- -- Gets -- ---------- procedure Gets (From : in String; ItemR : out Long_Long_Float; ItemI : out Long_Long_Float; Last : out Positive) is Paren : Boolean; Pos : Integer; begin String_Skip (From, Pos); if From (Pos) = '(' then Pos := Pos + 1; Paren := True; else Paren := False; end if; Aux.Gets (From (Pos .. From'Last), ItemR, Pos); String_Skip (From (Pos + 1 .. From'Last), Pos); if From (Pos) = ',' then Pos := Pos + 1; end if; Aux.Gets (From (Pos .. From'Last), ItemI, Pos); if Paren then String_Skip (From (Pos + 1 .. From'Last), Pos); if From (Pos) /= ')' then raise Data_Error; end if; end if; Last := Pos; end Gets; --------- -- Put -- --------- procedure Put (File : File_Type; ItemR : Long_Long_Float; ItemI : Long_Long_Float; Fore : Field; Aft : Field; Exp : Field) is begin Put (File, '('); Aux.Put (File, ItemR, Fore, Aft, Exp); Put (File, ','); Aux.Put (File, ItemI, Fore, Aft, Exp); Put (File, ')'); end Put; ---------- -- Puts -- ---------- procedure Puts (To : out String; ItemR : Long_Long_Float; ItemI : Long_Long_Float; Aft : in Field; Exp : in Field) is I_String : String (1 .. 3 * Field'Last); R_String : String (1 .. 3 * Field'Last); Iptr : Natural; Rptr : Natural; begin -- Both parts are initially converted with a Fore of 0 Rptr := 0; Set_Image_Real (ItemR, R_String, Rptr, 0, Aft, Exp); Iptr := 0; Set_Image_Real (ItemI, I_String, Iptr, 0, Aft, Exp); -- Check room for both parts plus parens plus comma (RM G.1.3(34)) if Rptr + Iptr + 3 > To'Length then raise Layout_Error; end if; -- If there is room, layout result according to (RM G.1.3(31-33)) To (To'First) := '('; To (To'First + 1 .. To'First + Rptr) := R_String (1 .. Rptr); To (To'First + Rptr + 1) := ','; To (To'Last) := ')'; To (To'Last - Iptr .. To'Last - 1) := I_String (1 .. Iptr); for J in To'First + Rptr + 2 .. To'Last - Iptr - 1 loop To (J) := ' '; end loop; end Puts; end Ada.Wide_Text_IO.Complex_Aux;

31.552885

78

0.461222

9a65bcbf33b21e0b724c44f512622650dac265e4

13,768

ads

Ada

extern/game_support/stm32f4/src/stm32f4-usarts.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

15

2020-10-07T08:56:45.000Z

2022-02-08T23:13:22.000Z

extern/game_support/stm32f4/src/stm32f4-usarts.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

20

2020-11-05T14:35:20.000Z

2022-01-13T15:59:33.000Z

extern/game_support/stm32f4/src/stm32f4-usarts.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

6

2020-10-08T15:57:06.000Z

2021-08-31T12:03:08.000Z

------------------------------------------------------------------------------ -- -- -- Hardware Abstraction Layer for STM32 Targets -- -- -- -- Copyright (C) 2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This file provides register definitions for the STM32F4 (ARM Cortex M4F) -- USART from ST Microelectronics. -- Note that there are board implementation assumptions represented by the -- private function APB_Clock. pragma Restrictions (No_Elaboration_Code); with System; package STM32F4.USARTs is type USART is limited private; procedure Enable (This : in out USART) with Post => Enabled (This), Inline; procedure Disable (This : in out USART) with Post => not Enabled (This), Inline; function Enabled (This : USART) return Boolean with Inline; procedure Receive (This : USART; Data : out Half_Word) with Inline; -- reads Device.DR into Data function Current_Input (This : USART) return Half_Word with Inline; -- returns Device.DR procedure Transmit (This : in out USART; Data : Half_Word) with Inline; function Tx_Ready (This : USART) return Boolean with Inline; function Rx_Ready (This : USART) return Boolean with Inline; type Stop_Bits is (Stopbits_1, Stopbits_2); for Stop_Bits use (Stopbits_1 => 0, Stopbits_2 => 16#2000#); for Stop_Bits'Size use Half_Word'Size; procedure Set_Stop_Bits (This : in out USART; To : Stop_Bits); type Word_Lengths is (Word_Length_8, Word_Length_9); for Word_Lengths use (Word_Length_8 => 0, Word_Length_9 => 16#1000#); for Word_Lengths'Size use Half_Word'Size; procedure Set_Word_Length (This : in out USART; To : Word_Lengths); type Parities is (No_Parity, Even_Parity, Odd_Parity); for Parities use (No_Parity => 0, Even_Parity => 16#0400#, Odd_Parity => 16#0600#); for Parities'Size use Half_Word'Size; procedure Set_Parity (This : in out USART; To : Parities); subtype Baud_Rates is Word range 110 .. 115_200 with Static_Predicate => Baud_Rates in 110 | 300 | 600 | 1200 | 2400 | 4800 | 9600 | 14_400 | 19_200 | 28_800 | 38_400 | 56_000 | 57_600 | 115_200; procedure Set_Baud_Rate (This : in out USART; To : Baud_Rates); type UART_Modes is (Rx_Mode, Tx_Mode, Tx_Rx_Mode); for UART_Modes use (Rx_Mode => 16#0004#, Tx_Mode => 16#0008#, Tx_Rx_Mode => 16#000C#); for UART_Modes'Size use Half_Word'Size; procedure Set_Mode (This : in out USART; To : UART_Modes); type Flow_Control is (No_Flow_Control, RTS_Flow_Control, CTS_Flow_Control, RTS_CTS_Flow_Control); for Flow_Control use (No_Flow_Control => 0, RTS_Flow_Control => 16#0100#, CTS_Flow_Control => 16#0200#, RTS_CTS_Flow_Control => 16#0300#); for Flow_Control'Size use Half_Word'Size; procedure Set_Flow_Control (This : in out USART; To : Flow_Control); type USART_Interrupt is (Parity_Error, Transmit_Data_Register_Empty, Transmission_Complete, Received_Data_Not_Empty, Idle_Line_Detection, Line_Break_Detection, Clear_To_Send, Error); procedure Enable_Interrupts (This : in out USART; Source : USART_Interrupt) with Post => Interrupt_Enabled (This, Source), Inline; procedure Disable_Interrupts (This : in out USART; Source : USART_Interrupt) with Post => not Interrupt_Enabled (This, Source), Inline; function Interrupt_Enabled (This : USART; Source : USART_Interrupt) return Boolean with Inline; type USART_Status_Flag is (Parity_Error_Indicated, Framing_Error_Indicated, USART_Noise_Error_Indicated, Overrun_Error_Indicated, Idle_Line_Detection_Indicated, Read_Data_Register_Not_Empty, Transmission_Complete_Indicated, Transmit_Data_Register_Empty, Line_Break_Detection_Indicated, Clear_To_Send_Indicated); function Status (This : USART; Flag : USART_Status_Flag) return Boolean with Inline; procedure Clear_Status (This : in out USART; Flag : USART_Status_Flag) with Inline; procedure Enable_DMA_Transmit_Requests (This : in out USART) with Inline, Post => DMA_Transmit_Requests_Enabled (This); procedure Disable_DMA_Transmit_Requests (This : in out USART) with Inline, Post => not DMA_Transmit_Requests_Enabled (This); function DMA_Transmit_Requests_Enabled (This : USART) return Boolean with Inline; procedure Enable_DMA_Receive_Requests (This : in out USART) with Inline, Post => DMA_Receive_Requests_Enabled (This); procedure Disable_DMA_Receive_Requests (This : in out USART) with Inline, Post => not DMA_Receive_Requests_Enabled (This); function DMA_Receive_Requests_Enabled (This : USART) return Boolean with Inline; procedure Pause_DMA_Transmission (This : in out USART) renames Disable_DMA_Transmit_Requests; procedure Resume_DMA_Transmission (This : in out USART) with Inline, Post => DMA_Transmit_Requests_Enabled (This) and Enabled (This); procedure Pause_DMA_Reception (This : in out USART) renames Disable_DMA_Receive_Requests; procedure Resume_DMA_Reception (This : in out USART) with Inline, Post => DMA_Receive_Requests_Enabled (This) and Enabled (This); ----------------------------- WARNING -------------------------------------- function Data_Register_Address (This : USART) return System.Address with Inline; -- Returns the address of the USART Data Register. This is exported -- STRICTLY for the sake of clients driving a USART via DMA. All other -- clients of this package should use the procedural interfaces Transmit -- and Receive instead of directly accessing the Data Register! -- Seriously, don't use this function otherwise. ----------------------------- WARNING -------------------------------------- private type Status_Register is record Reserved0 : Half_Word; Reserved1 : Bits_6; Clear_To_Send_Flag : Boolean; LIN_Break_Detected_Flag : Boolean; Transmit_Data_Register_Empty_Flag : Boolean; Transmission_Complete_Flag : Boolean; Read_Data_Register_Not_Empty_Flag : Boolean; IDLE_Line_Detected_Flag : Boolean; OverRun_Error_Flag : Boolean; Noise_Error_Flag : Boolean; Framing_Error_Flag : Boolean; Parity_Error_Flag : Boolean; end record with Atomic, Size => 32; for Status_Register use record Reserved0 at 0 range 16 .. 31; Reserved1 at 0 range 10 .. 15; Clear_To_Send_Flag at 0 range 9 .. 9; LIN_Break_Detected_Flag at 0 range 8 .. 8; Transmit_Data_Register_Empty_Flag at 0 range 7 .. 7; Transmission_Complete_Flag at 0 range 6 .. 6; Read_Data_Register_Not_Empty_Flag at 0 range 5 .. 5; IDLE_Line_Detected_Flag at 0 range 4 .. 4; OverRun_Error_Flag at 0 range 3 .. 3; Noise_Error_Flag at 0 range 2 .. 2; Framing_Error_Flag at 0 range 1 .. 1; Parity_Error_Flag at 0 range 0 .. 0; end record; for Status_Register'Bit_Order use System.Low_Order_First; type USART is limited record SR : Status_Register; DR : Half_Word; -- Data register Reserved_1 : Half_Word; BRR : Half_Word; -- Baud rate register Reserved_2 : Half_Word; CR1 : Half_Word; -- Control register 1 Reserved_3 : Half_Word; CR2 : Half_Word; -- Control register 2 Reserved_4 : Half_Word; CR3 : Half_Word; -- Control register 3 Reserved_5 : Half_Word; GTPR : Half_Word; -- Guard time and prescaler register Reserved_6 : Half_Word; end record with Volatile; for USART use record SR at 0 range 0 .. 31; DR at 4 range 0 .. 15; Reserved_1 at 6 range 0 .. 15; BRR at 8 range 0 .. 15; Reserved_2 at 10 range 0 .. 15; CR1 at 12 range 0 .. 15; Reserved_3 at 14 range 0 .. 15; CR2 at 16 range 0 .. 15; Reserved_4 at 18 range 0 .. 15; CR3 at 20 range 0 .. 15; Reserved_5 at 22 range 0 .. 15; GTPR at 24 range 0 .. 15; Reserved_6 at 26 range 0 .. 15; end record; function APB_Clock (This : USART) return Word with Inline; -- Returns either APB1 or APB2 clock rate, in Hertz, depending on the USART. -- For the sake of not making this package board-specific, we assume that -- we are given a valid USART object at a valid address, AND that the -- USART devices really are configured such that only 1 and 6 are on APB2. -- Therefore, if a board has additional USARTs beyond USART6, eg USART8 on -- the F429I Discovery board, they better conform to that assumption. USART_DR_MASK : constant Half_Word := 16#1FF#; -- TODO: consider replacing CRx with record types -- Bit definitions for USART CR1 register CR1_SBK : constant := 16#0001#; -- Send Break CR1_RWU : constant := 16#0002#; -- Receiver Wakeup CR1_RE : constant := 16#0004#; -- Receiver Enable CR1_TE : constant := 16#0008#; -- Transmitter Enable CR1_IDLEIE : constant := 16#0010#; -- IDLE Interrupt Enable CR1_RXNEIE : constant := 16#0020#; -- RXNE Interrupt Enable CR1_TCIE : constant := 16#0040#; -- Transmit Complete Interrupt Enable CR1_TXEIE : constant := 16#0080#; -- Transmit Data Register Empty Interrupt Enable CR1_PEIE : constant := 16#0100#; -- PE Interrupt Enable CR1_PS : constant := 16#0200#; -- Parity Selection CR1_PCE : constant := 16#0400#; -- Parity Control Enable CR1_WAKE : constant := 16#0800#; -- Wakeup Method CR1_M : constant := 16#1000#; -- Word Length CR1_UE : constant := 16#2000#; -- USART Enable CR1_OVER8 : constant := 16#8000#; -- Oversampling by 8 Enable -- Bit definitions for USART CR2 register CR2_ADD : constant := 16#000F#; -- Address of USART Node CR2_LBDL : constant := 16#0020#; -- LIN Brk Detection Length CR2_LBDIE : constant := 16#0040#; -- LIN Brk Detection Interrupt Enable CR2_LBCL : constant := 16#0100#; -- Last Bit Clock pulse CR2_CPHA : constant := 16#0200#; -- Clock Phase CR2_CPOL : constant := 16#0400#; -- Clock Polarity CR2_CLKEN : constant := 16#0800#; -- Clock Enable CR2_STOP : constant := 16#3000#; -- STOP bits CR2_STOP_0 : constant := 16#1000#; -- Bit 0 CR2_STOP_1 : constant := 16#2000#; -- Bit 1 CR2_LINEN : constant := 16#4000#; -- LIN mode enable -- Bit definitions for USART CR3 register CR3_EIE : constant := 16#0001#; -- Error Interrupt Enable CR3_IREN : constant := 16#0002#; -- IrDA mode Enable CR3_IRLP : constant := 16#0004#; -- IrDA Low-Power CR3_HDSEL : constant := 16#0008#; -- Half-Duplex Selection CR3_NACK : constant := 16#0010#; -- Smartcard NACK enable CR3_SCEN : constant := 16#0020#; -- Smartcard mode enable CR3_DMAR : constant := 16#0040#; -- DMA Enable Receiver CR3_DMAT : constant := 16#0080#; -- DMA Enable Transmitter CR3_RTSE : constant := 16#0100#; -- RTS Enable CR3_CTSE : constant := 16#0200#; -- CTS Enable CR3_CTSIE : constant := 16#0400#; -- CTS Interrupt Enable CR3_ONEBIT : constant := 16#0800#; -- One bit method enable end STM32F4.USARTs;

39.449857

88

0.603283

8b4905d77a76a6c6bc149c0ef3aecb6d084233f8

66,477

adb

Ada

awa/plugins/awa-questions/src/model/awa-questions-models.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-questions/src/model/awa-questions-models.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-questions/src/model/awa-questions-models.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- AWA.Questions.Models -- AWA.Questions.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-body.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Unchecked_Deallocation; with Util.Beans.Objects.Time; with ASF.Events.Faces.Actions; package body AWA.Questions.Models is use type ADO.Objects.Object_Record_Access; use type ADO.Objects.Object_Ref; pragma Warnings (Off, "formal parameter * is not referenced"); function Question_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => QUESTION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Question_Key; function Question_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => QUESTION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Question_Key; function "=" (Left, Right : Question_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Question_Ref'Class; Impl : out Question_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Question_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Question_Ref) is Impl : Question_Access; begin Impl := new Question_Impl; Impl.Create_Date := ADO.DEFAULT_TIME; Impl.Edit_Date.Is_Null := True; Impl.Rating := 0; Impl.Version := 0; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Question -- ---------------------------------------- procedure Set_Create_Date (Object : in out Question_Ref; Value : in Ada.Calendar.Time) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 1, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Question_Ref) return Ada.Calendar.Time is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Title (Object : in out Question_Ref; Value : in String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 2, Impl.Title, Value); end Set_Title; procedure Set_Title (Object : in out Question_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 2, Impl.Title, Value); end Set_Title; function Get_Title (Object : in Question_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Title); end Get_Title; function Get_Title (Object : in Question_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Title; end Get_Title; procedure Set_Description (Object : in out Question_Ref; Value : in String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Description, Value); end Set_Description; procedure Set_Description (Object : in out Question_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Description, Value); end Set_Description; function Get_Description (Object : in Question_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Description); end Get_Description; function Get_Description (Object : in Question_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Description; end Get_Description; procedure Set_Edit_Date (Object : in out Question_Ref; Value : in ADO.Nullable_Time) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 4, Impl.Edit_Date, Value); end Set_Edit_Date; function Get_Edit_Date (Object : in Question_Ref) return ADO.Nullable_Time is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Edit_Date; end Get_Edit_Date; procedure Set_Short_Description (Object : in out Question_Ref; Value : in String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 5, Impl.Short_Description, Value); end Set_Short_Description; procedure Set_Short_Description (Object : in out Question_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 5, Impl.Short_Description, Value); end Set_Short_Description; function Get_Short_Description (Object : in Question_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Short_Description); end Get_Short_Description; function Get_Short_Description (Object : in Question_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Short_Description; end Get_Short_Description; procedure Set_Rating (Object : in out Question_Ref; Value : in Integer) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Integer (Impl.all, 6, Impl.Rating, Value); end Set_Rating; function Get_Rating (Object : in Question_Ref) return Integer is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Rating; end Get_Rating; procedure Set_Id (Object : in out Question_Ref; Value : in ADO.Identifier) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 7, Value); end Set_Id; function Get_Id (Object : in Question_Ref) return ADO.Identifier is Impl : constant Question_Access := Question_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Question_Ref) return Integer is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Author (Object : in out Question_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 9, Impl.Author, Value); end Set_Author; function Get_Author (Object : in Question_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Author; end Get_Author; procedure Set_Workspace (Object : in out Question_Ref; Value : in AWA.Workspaces.Models.Workspace_Ref'Class) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 10, Impl.Workspace, Value); end Set_Workspace; function Get_Workspace (Object : in Question_Ref) return AWA.Workspaces.Models.Workspace_Ref'Class is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Workspace; end Get_Workspace; procedure Set_Accepted_Answer (Object : in out Question_Ref; Value : in AWA.Questions.Models.Answer_Ref'Class) is Impl : Question_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 11, Impl.Accepted_Answer, Value); end Set_Accepted_Answer; function Get_Accepted_Answer (Object : in Question_Ref) return AWA.Questions.Models.Answer_Ref'Class is Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Accepted_Answer; end Get_Accepted_Answer; -- Copy of the object. procedure Copy (Object : in Question_Ref; Into : in out Question_Ref) is Result : Question_Ref; begin if not Object.Is_Null then declare Impl : constant Question_Access := Question_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Question_Access := new Question_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Create_Date := Impl.Create_Date; Copy.Title := Impl.Title; Copy.Description := Impl.Description; Copy.Edit_Date := Impl.Edit_Date; Copy.Short_Description := Impl.Short_Description; Copy.Rating := Impl.Rating; Copy.Version := Impl.Version; Copy.Author := Impl.Author; Copy.Workspace := Impl.Workspace; Copy.Accepted_Answer := Impl.Accepted_Answer; end; end if; Into := Result; end Copy; procedure Find (Object : in out Question_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Question_Access := new Question_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Question_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Question_Access := new Question_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Question_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Question_Access := new Question_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Question_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Question_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Question_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Question_Impl) is type Question_Impl_Ptr is access all Question_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Question_Impl, Question_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Question_Impl_Ptr := Question_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Question_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, QUESTION_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Question_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Question_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (QUESTION_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_1_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (1); end if; if Object.Is_Modified (2) then Stmt.Save_Field (Name => COL_1_1_NAME, -- title Value => Object.Title); Object.Clear_Modified (2); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_1_NAME, -- description Value => Object.Description); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_1_NAME, -- edit_date Value => Object.Edit_Date); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_1_NAME, -- short_description Value => Object.Short_Description); Object.Clear_Modified (5); end if; if Object.Is_Modified (6) then Stmt.Save_Field (Name => COL_5_1_NAME, -- rating Value => Object.Rating); Object.Clear_Modified (6); end if; if Object.Is_Modified (7) then Stmt.Save_Field (Name => COL_6_1_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (7); end if; if Object.Is_Modified (9) then Stmt.Save_Field (Name => COL_8_1_NAME, -- author_id Value => Object.Author); Object.Clear_Modified (9); end if; if Object.Is_Modified (10) then Stmt.Save_Field (Name => COL_9_1_NAME, -- workspace_id Value => Object.Workspace); Object.Clear_Modified (10); end if; if Object.Is_Modified (11) then Stmt.Save_Field (Name => COL_10_1_NAME, -- accepted_answer_id Value => Object.Accepted_Answer); Object.Clear_Modified (11); end if; if Stmt.Has_Save_Fields then Object.Version := Object.Version + 1; Stmt.Save_Field (Name => "version", Value => Object.Version); Stmt.Set_Filter (Filter => "id = ? and version = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Add_Param (Value => Object.Version - 1); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; else raise ADO.Objects.LAZY_LOCK; end if; end if; end; end if; end Save; procedure Create (Object : in out Question_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (QUESTION_DEF'Access); Result : Integer; begin Object.Version := 1; Query.Save_Field (Name => COL_0_1_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_1_1_NAME, -- title Value => Object.Title); Query.Save_Field (Name => COL_2_1_NAME, -- description Value => Object.Description); Query.Save_Field (Name => COL_3_1_NAME, -- edit_date Value => Object.Edit_Date); Query.Save_Field (Name => COL_4_1_NAME, -- short_description Value => Object.Short_Description); Query.Save_Field (Name => COL_5_1_NAME, -- rating Value => Object.Rating); Session.Allocate (Id => Object); Query.Save_Field (Name => COL_6_1_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_7_1_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_8_1_NAME, -- author_id Value => Object.Author); Query.Save_Field (Name => COL_9_1_NAME, -- workspace_id Value => Object.Workspace); Query.Save_Field (Name => COL_10_1_NAME, -- accepted_answer_id Value => Object.Accepted_Answer); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Question_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (QUESTION_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Question_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Question_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Question_Impl (Obj.all)'Access; if Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); elsif Name = "title" then return Util.Beans.Objects.To_Object (Impl.Title); elsif Name = "description" then return Util.Beans.Objects.To_Object (Impl.Description); elsif Name = "edit_date" then if Impl.Edit_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (Impl.Edit_Date.Value); end if; elsif Name = "short_description" then return Util.Beans.Objects.To_Object (Impl.Short_Description); elsif Name = "rating" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Rating)); elsif Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Question_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Create_Date := Stmt.Get_Time (0); Object.Title := Stmt.Get_Unbounded_String (1); Object.Description := Stmt.Get_Unbounded_String (2); Object.Edit_Date := Stmt.Get_Nullable_Time (3); Object.Short_Description := Stmt.Get_Unbounded_String (4); Object.Rating := Stmt.Get_Integer (5); Object.Set_Key_Value (Stmt.Get_Identifier (6)); if not Stmt.Is_Null (8) then Object.Author.Set_Key_Value (Stmt.Get_Identifier (8), Session); end if; if not Stmt.Is_Null (9) then Object.Workspace.Set_Key_Value (Stmt.Get_Identifier (9), Session); end if; if not Stmt.Is_Null (10) then Object.Accepted_Answer.Set_Key_Value (Stmt.Get_Identifier (10), Session); end if; Object.Version := Stmt.Get_Integer (7); ADO.Objects.Set_Created (Object); end Load; function Answer_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => ANSWER_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Answer_Key; function Answer_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => ANSWER_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Answer_Key; function "=" (Left, Right : Answer_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Answer_Ref'Class; Impl : out Answer_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Answer_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Answer_Ref) is Impl : Answer_Access; begin Impl := new Answer_Impl; Impl.Create_Date := ADO.DEFAULT_TIME; Impl.Edit_Date.Is_Null := True; Impl.Rank := 0; Impl.Version := 0; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Answer -- ---------------------------------------- procedure Set_Create_Date (Object : in out Answer_Ref; Value : in Ada.Calendar.Time) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 1, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Answer_Ref) return Ada.Calendar.Time is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Edit_Date (Object : in out Answer_Ref; Value : in ADO.Nullable_Time) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 2, Impl.Edit_Date, Value); end Set_Edit_Date; function Get_Edit_Date (Object : in Answer_Ref) return ADO.Nullable_Time is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Edit_Date; end Get_Edit_Date; procedure Set_Answer (Object : in out Answer_Ref; Value : in String) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Answer, Value); end Set_Answer; procedure Set_Answer (Object : in out Answer_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Answer, Value); end Set_Answer; function Get_Answer (Object : in Answer_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Answer); end Get_Answer; function Get_Answer (Object : in Answer_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Answer; end Get_Answer; procedure Set_Rank (Object : in out Answer_Ref; Value : in Integer) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Integer (Impl.all, 4, Impl.Rank, Value); end Set_Rank; function Get_Rank (Object : in Answer_Ref) return Integer is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Rank; end Get_Rank; procedure Set_Id (Object : in out Answer_Ref; Value : in ADO.Identifier) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 5, Value); end Set_Id; function Get_Id (Object : in Answer_Ref) return ADO.Identifier is Impl : constant Answer_Access := Answer_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Answer_Ref) return Integer is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Author (Object : in out Answer_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 7, Impl.Author, Value); end Set_Author; function Get_Author (Object : in Answer_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Author; end Get_Author; procedure Set_Question (Object : in out Answer_Ref; Value : in AWA.Questions.Models.Question_Ref'Class) is Impl : Answer_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 8, Impl.Question, Value); end Set_Question; function Get_Question (Object : in Answer_Ref) return AWA.Questions.Models.Question_Ref'Class is Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Question; end Get_Question; -- Copy of the object. procedure Copy (Object : in Answer_Ref; Into : in out Answer_Ref) is Result : Answer_Ref; begin if not Object.Is_Null then declare Impl : constant Answer_Access := Answer_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Answer_Access := new Answer_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Create_Date := Impl.Create_Date; Copy.Edit_Date := Impl.Edit_Date; Copy.Answer := Impl.Answer; Copy.Rank := Impl.Rank; Copy.Version := Impl.Version; Copy.Author := Impl.Author; Copy.Question := Impl.Question; end; end if; Into := Result; end Copy; procedure Find (Object : in out Answer_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Answer_Access := new Answer_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Answer_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Answer_Access := new Answer_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Answer_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Answer_Access := new Answer_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Answer_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Answer_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Answer_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Answer_Impl) is type Answer_Impl_Ptr is access all Answer_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Answer_Impl, Answer_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Answer_Impl_Ptr := Answer_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Answer_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, ANSWER_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Answer_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Answer_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (ANSWER_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_2_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (1); end if; if Object.Is_Modified (2) then Stmt.Save_Field (Name => COL_1_2_NAME, -- edit_date Value => Object.Edit_Date); Object.Clear_Modified (2); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_2_NAME, -- answer Value => Object.Answer); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_2_NAME, -- rank Value => Object.Rank); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_2_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (5); end if; if Object.Is_Modified (7) then Stmt.Save_Field (Name => COL_6_2_NAME, -- author_id Value => Object.Author); Object.Clear_Modified (7); end if; if Object.Is_Modified (8) then Stmt.Save_Field (Name => COL_7_2_NAME, -- question_id Value => Object.Question); Object.Clear_Modified (8); end if; if Stmt.Has_Save_Fields then Object.Version := Object.Version + 1; Stmt.Save_Field (Name => "version", Value => Object.Version); Stmt.Set_Filter (Filter => "id = ? and version = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Add_Param (Value => Object.Version - 1); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; else raise ADO.Objects.LAZY_LOCK; end if; end if; end; end if; end Save; procedure Create (Object : in out Answer_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (ANSWER_DEF'Access); Result : Integer; begin Object.Version := 1; Query.Save_Field (Name => COL_0_2_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_1_2_NAME, -- edit_date Value => Object.Edit_Date); Query.Save_Field (Name => COL_2_2_NAME, -- answer Value => Object.Answer); Query.Save_Field (Name => COL_3_2_NAME, -- rank Value => Object.Rank); Session.Allocate (Id => Object); Query.Save_Field (Name => COL_4_2_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_5_2_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_6_2_NAME, -- author_id Value => Object.Author); Query.Save_Field (Name => COL_7_2_NAME, -- question_id Value => Object.Question); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Answer_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (ANSWER_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Answer_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Answer_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Answer_Impl (Obj.all)'Access; if Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); elsif Name = "edit_date" then if Impl.Edit_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (Impl.Edit_Date.Value); end if; elsif Name = "answer" then return Util.Beans.Objects.To_Object (Impl.Answer); elsif Name = "rank" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Rank)); elsif Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Answer_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Create_Date := Stmt.Get_Time (0); Object.Edit_Date := Stmt.Get_Nullable_Time (1); Object.Answer := Stmt.Get_Unbounded_String (2); Object.Rank := Stmt.Get_Integer (3); Object.Set_Key_Value (Stmt.Get_Identifier (4)); if not Stmt.Is_Null (6) then Object.Author.Set_Key_Value (Stmt.Get_Identifier (6), Session); end if; if not Stmt.Is_Null (7) then Object.Question.Set_Key_Value (Stmt.Get_Identifier (7), Session); end if; Object.Version := Stmt.Get_Integer (5); ADO.Objects.Set_Created (Object); end Load; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Answer_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (From.Create_Date); elsif Name = "edit_date" then if From.Edit_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (From.Edit_Date.Value); end if; elsif Name = "answer" then return Util.Beans.Objects.To_Object (From.Answer); elsif Name = "rank" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Rank)); elsif Name = "user_rating" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.User_Rating)); elsif Name = "author_id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Author_Id)); elsif Name = "author_name" then return Util.Beans.Objects.To_Object (From.Author_Name); elsif Name = "author_email" then return Util.Beans.Objects.To_Object (From.Author_Email); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Answer_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "create_date" then Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value); elsif Name = "edit_date" then Item.Edit_Date.Is_Null := Util.Beans.Objects.Is_Null (Value); if not Item.Edit_Date.Is_Null then Item.Edit_Date.Value := Util.Beans.Objects.Time.To_Time (Value); end if; elsif Name = "answer" then Item.Answer := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "rank" then Item.Rank := Util.Beans.Objects.To_Integer (Value); elsif Name = "user_rating" then Item.User_Rating := Util.Beans.Objects.To_Integer (Value); elsif Name = "author_id" then Item.Author_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "author_name" then Item.Author_Name := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "author_email" then Item.Author_Email := Util.Beans.Objects.To_Unbounded_String (Value); end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out Answer_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The list of answers. -- -------------------- procedure List (Object : in out Answer_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out Answer_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out Answer_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.Create_Date := Stmt.Get_Time (1); Into.Edit_Date := Stmt.Get_Nullable_Time (2); Into.Answer := Stmt.Get_Unbounded_String (3); Into.Rank := Stmt.Get_Integer (4); Into.User_Rating := Stmt.Get_Integer (5); Into.Author_Id := Stmt.Get_Identifier (6); Into.Author_Name := Stmt.Get_Unbounded_String (7); Into.Author_Email := Stmt.Get_Unbounded_String (8); end Read; begin Stmt.Execute; Answer_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Question_Display_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "title" then return Util.Beans.Objects.To_Object (From.Title); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (From.Create_Date); elsif Name = "edit_date" then if From.Edit_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (From.Edit_Date.Value); end if; elsif Name = "description" then return Util.Beans.Objects.To_Object (From.Description); elsif Name = "rating" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Rating)); elsif Name = "user_rating" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.User_Rating)); elsif Name = "author_id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Author_Id)); elsif Name = "author_name" then return Util.Beans.Objects.To_Object (From.Author_Name); elsif Name = "author_email" then return Util.Beans.Objects.To_Object (From.Author_Email); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Question_Display_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "title" then Item.Title := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "create_date" then Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value); elsif Name = "edit_date" then Item.Edit_Date.Is_Null := Util.Beans.Objects.Is_Null (Value); if not Item.Edit_Date.Is_Null then Item.Edit_Date.Value := Util.Beans.Objects.Time.To_Time (Value); end if; elsif Name = "description" then Item.Description := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "rating" then Item.Rating := Util.Beans.Objects.To_Integer (Value); elsif Name = "user_rating" then Item.User_Rating := Util.Beans.Objects.To_Integer (Value); elsif Name = "author_id" then Item.Author_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "author_name" then Item.Author_Name := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "author_email" then Item.Author_Email := Util.Beans.Objects.To_Unbounded_String (Value); end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out Question_Display_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The list of questions. -- -------------------- procedure List (Object : in out Question_Display_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out Question_Display_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out Question_Display_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.Title := Stmt.Get_Unbounded_String (1); Into.Create_Date := Stmt.Get_Time (2); Into.Edit_Date := Stmt.Get_Nullable_Time (3); Into.Description := Stmt.Get_Unbounded_String (4); Into.Rating := Stmt.Get_Integer (5); Into.User_Rating := Stmt.Get_Integer (6); Into.Author_Id := Stmt.Get_Identifier (7); Into.Author_Name := Stmt.Get_Unbounded_String (8); Into.Author_Email := Stmt.Get_Unbounded_String (9); end Read; begin Stmt.Execute; Question_Display_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Question_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "title" then return Util.Beans.Objects.To_Object (From.Title); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (From.Create_Date); elsif Name = "description" then return Util.Beans.Objects.To_Object (From.Description); elsif Name = "rating" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Rating)); elsif Name = "answer_count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Answer_Count)); elsif Name = "author_id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Author_Id)); elsif Name = "author_name" then return Util.Beans.Objects.To_Object (From.Author_Name); elsif Name = "author_email" then return Util.Beans.Objects.To_Object (From.Author_Email); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Question_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "title" then Item.Title := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "create_date" then Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value); elsif Name = "description" then Item.Description := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "rating" then Item.Rating := Util.Beans.Objects.To_Integer (Value); elsif Name = "answer_count" then Item.Answer_Count := Util.Beans.Objects.To_Integer (Value); elsif Name = "author_id" then Item.Author_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "author_name" then Item.Author_Name := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "author_email" then Item.Author_Email := Util.Beans.Objects.To_Unbounded_String (Value); end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out Question_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The list of questions. -- -------------------- procedure List (Object : in out Question_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out Question_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out Question_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.Title := Stmt.Get_Unbounded_String (1); Into.Create_Date := Stmt.Get_Time (2); Into.Description := Stmt.Get_Unbounded_String (3); Into.Rating := Stmt.Get_Integer (4); Into.Answer_Count := Stmt.Get_Integer (5); Into.Author_Id := Stmt.Get_Identifier (6); Into.Author_Name := Stmt.Get_Unbounded_String (7); Into.Author_Email := Stmt.Get_Unbounded_String (8); end Read; begin Stmt.Execute; Question_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; procedure Op_Save (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Save (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Question_Bean'Class (Bean).Save (Outcome); end Op_Save; package Binding_Question_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Question_Bean, Method => Op_Save, Name => "save"); procedure Op_Delete (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Delete (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Question_Bean'Class (Bean).Delete (Outcome); end Op_Delete; package Binding_Question_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Question_Bean, Method => Op_Delete, Name => "delete"); procedure Op_Load (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Question_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Question_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Question_Bean_3 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Question_Bean, Method => Op_Load, Name => "load"); Binding_Question_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Question_Bean_1.Proxy'Access, 2 => Binding_Question_Bean_2.Proxy'Access, 3 => Binding_Question_Bean_3.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Question_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Question_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Question_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "create_date" then Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "title" then Item.Set_Title (Util.Beans.Objects.To_String (Value)); elsif Name = "description" then Item.Set_Description (Util.Beans.Objects.To_String (Value)); elsif Name = "edit_date" then if Util.Beans.Objects.Is_Null (Value) then Item.Set_Edit_Date (ADO.Nullable_Time '(Is_Null => True, others => <>)); else Item.Set_Edit_Date (ADO.Nullable_Time '(Is_Null => False, Value => Util.Beans.Objects.Time.To_Time (Value))); end if; elsif Name = "short_description" then Item.Set_Short_Description (Util.Beans.Objects.To_String (Value)); elsif Name = "rating" then Item.Set_Rating (Util.Beans.Objects.To_Integer (Value)); end if; end Set_Value; procedure Op_Save (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Save (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Answer_Bean'Class (Bean).Save (Outcome); end Op_Save; package Binding_Answer_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Answer_Bean, Method => Op_Save, Name => "save"); procedure Op_Delete (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Delete (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Answer_Bean'Class (Bean).Delete (Outcome); end Op_Delete; package Binding_Answer_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Answer_Bean, Method => Op_Delete, Name => "delete"); procedure Op_Load (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Answer_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Answer_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Answer_Bean_3 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Answer_Bean, Method => Op_Load, Name => "load"); Binding_Answer_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Answer_Bean_1.Proxy'Access, 2 => Binding_Answer_Bean_2.Proxy'Access, 3 => Binding_Answer_Bean_3.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Answer_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Answer_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Answer_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "create_date" then Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "edit_date" then if Util.Beans.Objects.Is_Null (Value) then Item.Set_Edit_Date (ADO.Nullable_Time '(Is_Null => True, others => <>)); else Item.Set_Edit_Date (ADO.Nullable_Time '(Is_Null => False, Value => Util.Beans.Objects.Time.To_Time (Value))); end if; elsif Name = "answer" then Item.Set_Answer (Util.Beans.Objects.To_String (Value)); elsif Name = "rank" then Item.Set_Rank (Util.Beans.Objects.To_Integer (Value)); end if; end Set_Value; procedure Op_Load (Bean : in out Question_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Question_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Question_List_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Question_List_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Question_List_Bean, Method => Op_Load, Name => "load"); Binding_Question_List_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Question_List_Bean_1.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Question_List_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Question_List_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Question_List_Bean; Name : in String) return Util.Beans.Objects.Object is begin if Name = "tag" then return Util.Beans.Objects.To_Object (From.Tag); elsif Name = "page" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page)); elsif Name = "page_size" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page_Size)); elsif Name = "count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count)); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Question_List_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "tag" then Item.Tag := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "page" then Item.Page := Util.Beans.Objects.To_Integer (Value); elsif Name = "page_size" then Item.Page_Size := Util.Beans.Objects.To_Integer (Value); elsif Name = "count" then Item.Count := Util.Beans.Objects.To_Integer (Value); end if; end Set_Value; procedure Op_Load (Bean : in out Question_Display_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Question_Display_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Question_Display_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Question_Display_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Question_Display_Bean, Method => Op_Load, Name => "load"); Binding_Question_Display_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Question_Display_Bean_1.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Question_Display_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Question_Display_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Question_Display_Bean; Name : in String) return Util.Beans.Objects.Object is begin return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Question_Display_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin null; end Set_Value; end AWA.Questions.Models;

38.515064

97

0.593092

9aaa389ad8e5d47a7ae6c7b8ce2e7086db41f0c4

4,229

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-spsufi.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-spsufi.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-spsufi.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- SYSTEM.STORAGE_POOLS.SUBPOOLS.FINALIZATION -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Unchecked_Deallocation; with System.Finalization_Masters; use System.Finalization_Masters; package body System.Storage_Pools.Subpools.Finalization is ----------------------------- -- Finalize_And_Deallocate -- ----------------------------- procedure Finalize_And_Deallocate (Subpool : in out Subpool_Handle) is procedure Free is new Ada.Unchecked_Deallocation (SP_Node, SP_Node_Ptr); begin -- Do nothing if the subpool was never created or never used. The latter -- case may arise with an array of subpool implementations. if Subpool = null or else Subpool.Owner = null or else Subpool.Node = null then return; end if; -- Clean up all controlled objects chained on the subpool's master Finalize (Subpool.Master); -- Remove the subpool from its owner's list of subpools Detach (Subpool.Node); -- Destroy the associated doubly linked list node which was created in -- Set_Pool_Of_Subpools. Free (Subpool.Node); -- Dispatch to the user-defined implementation of Deallocate_Subpool. It -- is important to first set Subpool.Owner to null, because RM-13.11.5 -- requires that "The subpool no longer belongs to any pool" BEFORE -- calling Deallocate_Subpool. The actual dispatching call required is: -- -- Deallocate_Subpool(Pool_Of_Subpool(Subpool).all, Subpool); -- -- but that can't be taken literally, because Pool_Of_Subpool will -- return null. declare Owner : constant Any_Storage_Pool_With_Subpools_Ptr := Subpool.Owner; begin Subpool.Owner := null; Deallocate_Subpool (Owner.all, Subpool); end; Subpool := null; end Finalize_And_Deallocate; end System.Storage_Pools.Subpools.Finalization;

46.988889

79

0.501064

ad66836a40182a29309e31aec9532200ff16804e

362

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/vect15.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/vect15.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/vect15.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile { target i?86-*-* x86_64-*-* } } -- { dg-options "-O3 -msse2 -fdump-tree-vect-details" } package body Vect15 is procedure Add (X, Y : Sarray; R : out Sarray) is begin for I in Sarray'Range loop R(I) := X(I) + Y(I); end loop; end; end Vect15; -- { dg-final { scan-tree-dump-not "possible aliasing" "vect" } }

22.625

66

0.569061

04b373ace8651a13922aeaf1883dd2ab2558a0cf

2,501

ads

Ada

tools-src/gnu/gcc/gcc/ada/hlo.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/hlo.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/hlo.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- H L O -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1998 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Types; use Types; package HLO is procedure High_Level_Optimize (N : Node_Id); -- This procedure activates the high level optimizer. At the time it is -- called, the tree for compilation unit N has been fully analyzed, but -- not expanded, but the Analyzed flags have been reset. On return, the -- tree may be modified (and will be reanalyzed and expanded as required). end HLO;

62.525

78

0.401439

1e0a8f8b7c69fac5a1f3fca0fc8f12e141aef97b

25,833

ads

Ada

tools/src/excel_writer/excel_out.ads

fjudith/sql-benchmark

13a5e20d59a9ddac02eca252db125934b7ec177c

[ "Apache-2.0" ]

24

2018-10-28T11:04:19.000Z

2021-11-16T12:29:21.000Z

tools/src/excel_writer/excel_out.ads

fjudith/sql-benchmark

13a5e20d59a9ddac02eca252db125934b7ec177c

[ "Apache-2.0" ]

1

2022-02-16T00:55:45.000Z

tools/src/excel_writer/excel_out.ads

fjudith/sql-benchmark

13a5e20d59a9ddac02eca252db125934b7ec177c

[ "Apache-2.0" ]

3

2019-04-15T17:04:26.000Z

2020-10-29T21:27:49.000Z

------------------------------------------------------------------------------------- -- -- EXCEL_OUT - A low level package for writing Microsoft Excel (*) files -- -- Pure Ada 95 code, 100% portable: OS-, CPU- and compiler- independent. -- -- Version / date / download info: see the version, reference, web strings -- defined at the end of the public part of this package. -- Legal licensing note: -- Copyright (c) 2009 .. 2018 Gautier de Montmollin -- 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. -- NB: this is the MIT License, as found 12-Sep-2007 on the site -- http://www.opensource.org/licenses/mit-license.php -- Derived from ExcelOut by Frank Schoonjans in Modula-2 - thanks! -- (*) All Trademarks mentioned are properties of their respective owners. ------------------------------------------------------------------------------------- -- -- Follow these steps to create an Excel spreadsheet stream: -- -- 1. Create -- -- 2. Optional settings, before any data output: -- | Write_default_column_width -- | Write_column_width for specific columns -- | Write_default_row_height -- | Write_row_height for specific rows -- | Define_font, then Define_format -- -- 3. | Write(xl, row, column, data): row by row, column by column -- | Put(xl, data) : same, but column is auto-incremented -- | New_Line(xl),... : other "Text_IO"-like (full list below) -- | Use_format, influences the format of data written next -- -- 4. Close -- -- 5. (Excel_Out_String only) function Contents returns the full .xls -------------------------------------------------------------------------- with Ada.Calendar; use Ada.Calendar; with Ada.Streams.Stream_IO; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Ada.Text_IO; package Excel_Out is ----------------------------------------------------------------- -- The abstract Excel output stream root type. -- -- From this package, you can use the following derived types: -- -- * Excel_Out_File : output in a file -- -- * Excel_Out_String : output in a string -- -- Of course you can define your own derived types. -- ----------------------------------------------------------------- type Excel_Out_Stream is abstract tagged private; ---------------------------------- -- (2) Before any cell content: -- ---------------------------------- -- * Page layout for printing procedure Header(xl : Excel_Out_Stream; page_header_string: String); procedure Footer(xl : Excel_Out_Stream; page_footer_string: String); -- procedure Left_Margin(xl : Excel_Out_Stream; inches: Long_Float); procedure Right_Margin(xl : Excel_Out_Stream; inches: Long_Float); procedure Top_Margin(xl : Excel_Out_Stream; inches: Long_Float); procedure Bottom_Margin(xl : Excel_Out_Stream; inches: Long_Float); procedure Margins(xl : Excel_Out_Stream; left, right, top, bottom: Long_Float); -- procedure Print_Row_Column_Headers(xl : Excel_Out_Stream); procedure Print_Gridlines(xl : Excel_Out_Stream); -- type Orientation_choice is (landscape, portrait); type Scale_or_fit_choice is (scale, fit); procedure Page_Setup( xl : Excel_Out_Stream; scaling_percents : Positive:= 100; fit_width_with_n_pages : Natural:= 1; -- 0: as many as possible fit_height_with_n_pages: Natural:= 1; -- 0: as many as possible orientation : Orientation_choice:= portrait; scale_or_fit : Scale_or_fit_choice:= scale ); -- * The column width unit is as it appears in Excel when you resize a column. -- It is the width of a '0' in a standard font. procedure Write_default_column_width(xl : in out Excel_Out_Stream; width : Positive); procedure Write_column_width(xl : in out Excel_Out_Stream; column: Positive; width: Natural); procedure Write_column_width( xl : in out Excel_Out_Stream; first_column, last_column : Positive; width : Natural ); -- * The row height unit is in font points, as appearing when you -- resize a row in Excel. A zero height means the row is hidden. procedure Write_default_row_height(xl: Excel_Out_Stream; height: Positive); procedure Write_row_height(xl : Excel_Out_Stream; row: Positive; height : Natural); ---------------------- -- Formatting cells -- ---------------------- -- A cell format is, as you can see in the format dialog -- in Excel, a combination of: -- - a number format -- - a set of alignements -- - a font -- - and other optional things to come here... -- Formats are user-defined except one which is predefined: Default_format type Format_type is private; function Default_format(xl: Excel_Out_Stream) return Format_type; -- What you get when creating a new sheet in Excel: Default_font,... -- * Number format type Number_format_type is private; -- Built-in number formats general : constant Number_format_type; decimal_0 : constant Number_format_type; decimal_2 : constant Number_format_type; decimal_0_thousands_separator: constant Number_format_type; -- 1'234'000 decimal_2_thousands_separator: constant Number_format_type; -- 1'234'000.00 percent_0 : constant Number_format_type; -- 3%, 0%, -4% percent_2 : constant Number_format_type; percent_0_plus : constant Number_format_type; -- +3%, 0%, -4% percent_2_plus : constant Number_format_type; scientific : constant Number_format_type; dd_mm_yyyy : constant Number_format_type; dd_mm_yyyy_hh_mm : constant Number_format_type; hh_mm : constant Number_format_type; hh_mm_ss : constant Number_format_type; procedure Define_number_format( xl : in out Excel_Out_Stream; format : out Number_format_type; format_string: in String ); -- * Fonts are user-defined, one is predefined: Default_font type Font_type is private; function Default_font(xl: Excel_Out_Stream) return Font_type; -- Arial 10, regular, "automatic" color type Color_type is (automatic, black, white, red, green, blue, yellow, magenta, cyan, dark_red, dark_green, dark_blue, olive, purple, teal, silver, grey); type Font_style is private; -- For combining font styles (e.g.: bold & underlined): function "&"(a,b: Font_style) return Font_style; regular : constant Font_style; italic : constant Font_style; bold : constant Font_style; bold_italic : constant Font_style; underlined : constant Font_style; struck_out : constant Font_style; shadowed : constant Font_style; condensed : constant Font_style; extended : constant Font_style; procedure Define_font( xl : in out Excel_Out_Stream; font_name : String; height : Positive; font : out Font_type; -- optional: style : Font_style:= regular; color : Color_type:= automatic ); type Horizontal_alignment is ( general_alignment, to_left, centred, to_right, filled, justified, centred_across_selection, -- (BIFF4-BIFF8) distributed -- (BIFF8, Excel 10.0 ("XP") and later only) ); type Vertical_alignment is ( top_alignment, centred, bottom_alignment, justified, -- (BIFF5-BIFF8) distributed -- (BIFF8, Excel 10.0 ("XP") and later only) ); type Text_orientation is ( normal, stacked, -- vertical, top to bottom rotated_90, -- vertical, rotated 90 degrees counterclockwise rotated_270 -- vertical, rotated 90 degrees clockwise ); type Cell_border is private; -- Operator for combining borders (e.g.: left & top): function "&"(a,b: Cell_border) return Cell_border; no_border : constant Cell_border; left : constant Cell_border; right : constant Cell_border; top : constant Cell_border; bottom : constant Cell_border; box : constant Cell_border; procedure Define_format( xl : in out Excel_Out_Stream; font : in Font_type; -- Default_font(xl), or given by Define_font number_format : in Number_format_type; -- built-in, or given by Define_number_format cell_format : out Format_type; -- Optional parameters -- horizontal_align : in Horizontal_alignment:= general_alignment; border : in Cell_border:= no_border; shaded : in Boolean:= False; -- Add a dotted background pattern background_color : in Color_type:= automatic; wrap_text : in Boolean:= False; vertical_align : in Vertical_alignment:= bottom_alignment; text_orient : in Text_orientation:= normal ); ------------------------ -- (3) Cell contents: -- ------------------------ -- NB: you need to write with ascending row index and with ascending -- column index within a row; otherwise Excel issues a protest procedure Write(xl: in out Excel_Out_Stream; r,c : Positive; num : Long_Float); procedure Write(xl: in out Excel_Out_Stream; r,c : Positive; num : Integer); procedure Write(xl: in out Excel_Out_Stream; r,c : Positive; str : String); procedure Write(xl: in out Excel_Out_Stream; r,c : Positive; str : Unbounded_String); procedure Write(xl: in out Excel_Out_Stream; r,c : Positive; date: Time); -- "Ada.Text_IO" - like output. -- No need to specify row & column each time. -- Write 'Put(x, content)' where x is an Excel_Out_Stream just -- as if x was a File_Type, and vice-versa. -- procedure Put(xl: in out Excel_Out_Stream; num : Long_Float); procedure Put(xl : in out Excel_Out_Stream; num : in Integer; width : in Ada.Text_IO.Field := 0; -- ignored base : in Ada.Text_IO.Number_Base := 10 ); procedure Put(xl: in out Excel_Out_Stream; str : String); procedure Put(xl: in out Excel_Out_Stream; str : Unbounded_String); procedure Put(xl: in out Excel_Out_Stream; date: Time); -- procedure Put_Line(xl: in out Excel_Out_Stream; num : Long_Float); procedure Put_Line(xl: in out Excel_Out_Stream; num : Integer); procedure Put_Line(xl: in out Excel_Out_Stream; str : String); procedure Put_Line(xl: in out Excel_Out_Stream; str : Unbounded_String); procedure Put_Line(xl: in out Excel_Out_Stream; date: Time); -- procedure New_Line(xl: in out Excel_Out_Stream; Spacing : Positive := 1); -- Get current column and row. The next Put will put contents in that cell. -- function Col(xl: in Excel_Out_Stream) return Positive; -- Text_IO naming function Column(xl: in Excel_Out_Stream) return Positive; -- Excel naming function Line(xl: in Excel_Out_Stream) return Positive; -- Text_IO naming function Row(xl: in Excel_Out_Stream) return Positive; -- Excel naming -- Relative / absolute jumps procedure Jump(xl: in out Excel_Out_Stream; rows, columns: Natural); procedure Jump_to(xl: in out Excel_Out_Stream; row, column: Positive); procedure Next(xl: in out Excel_Out_Stream; columns: Natural:= 1); -- Jump 0 or more cells right procedure Next_Row(xl: in out Excel_Out_Stream; rows: Natural:= 1); -- Jump 0 or more cells down -- -- Merge a certain amount of cells with the last one, -- right to that cell, on the same row. procedure Merge(xl: in out Excel_Out_Stream; cells: Positive); procedure Write_cell_comment(xl: Excel_Out_Stream; row, column: Positive; text: String); procedure Write_cell_comment_at_cursor(xl: Excel_Out_Stream; text: String); -- Cells written after Use_format will be using the given format, -- defined by Define_format. procedure Use_format( xl : in out Excel_Out_Stream; format : in Format_type ); procedure Use_default_format(xl: in out Excel_Out_Stream); -- The Freeze Pane methods can be called anytime before Close procedure Freeze_Panes(xl: in out Excel_Out_Stream; row, column: Positive); procedure Freeze_Panes_at_cursor(xl: in out Excel_Out_Stream); procedure Freeze_Top_Row(xl: in out Excel_Out_Stream); procedure Freeze_First_Column(xl: in out Excel_Out_Stream); -- Zoom level. Example: for 85%, call with parameters 85, 100. procedure Zoom_level(xl: in out Excel_Out_Stream; numerator, denominator: Positive); -- Set_Index and Index are not directly useful for Excel_Out users. -- They are private indeed, but they must be visible (RM 3.9.3(10)). -- Set the index on the stream procedure Set_Index (xl: in out Excel_Out_Stream; to: Ada.Streams.Stream_IO.Positive_Count) is abstract; -- Return the index of the stream function Index (xl: Excel_Out_Stream) return Ada.Streams.Stream_IO.Count is abstract; Excel_stream_not_created, Excel_stream_not_closed, Decreasing_row_index, Decreasing_column_index, Row_out_of_range, Column_out_of_range : exception; type Excel_type is ( BIFF2, -- Excel 2.1, 2,2 BIFF3, -- Excel 3.0 BIFF4 -- Excel 4.0 -- BIFF5, -- Excel 5.0 to 7.0 -- BIFF8 -- Excel 8.0 (97) to 11.0 (2003) - UTF-16 support ); Default_Excel_type: constant Excel_type:= BIFF4; -- Assumed encoding for types Character and String (8-bit): type Encoding_type is ( Windows_CP_874, -- Thai Windows_CP_932, -- Japanese Shift-JIS Windows_CP_936, -- Chinese Simplified GBK Windows_CP_949, -- Korean (Wansung) Windows_CP_950, -- Chinese Traditional BIG5 Windows_CP_1250, -- Latin II (Central European) Windows_CP_1251, -- Cyrillic Windows_CP_1252, -- Latin I, superset of ISO 8859-1 Windows_CP_1253, -- Greek Windows_CP_1254, -- Turkish Windows_CP_1255, -- Hebrew Windows_CP_1256, -- Arabic Windows_CP_1257, -- Baltic Windows_CP_1258, -- Vietnamese Windows_CP_1361, -- Korean (Johab) Apple_Roman ); Default_encoding: constant Encoding_type:= Windows_CP_1252; ----------------------------------------------------------------- -- Here, the derived stream types pre-defined in this package. -- ----------------------------------------------------------------- -- * Output to a file: type Excel_Out_File is new Excel_Out_Stream with private; procedure Create( xl : in out Excel_Out_File; file_name : String; excel_format : Excel_type := Default_Excel_type; encoding : Encoding_type := Default_encoding ); procedure Close(xl : in out Excel_Out_File); function Is_Open(xl : in Excel_Out_File) return Boolean; -- * Output to a string (to be compressed, packaged, transmitted, ... ): type Excel_Out_String is new Excel_Out_Stream with private; procedure Create( xl : in out Excel_Out_String; excel_format : Excel_type := Default_Excel_type; encoding : Encoding_type := Default_encoding ); procedure Close(xl : in out Excel_Out_String); function Contents(xl: Excel_Out_String) return String; ---------------------------------------------------------------- -- Information about this package - e.g. for an "about" box -- ---------------------------------------------------------------- version : constant String:= "17"; reference : constant String:= "18-Oct-2018"; web : constant String:= "http://excel-writer.sf.net/"; -- hopefully the latest version is at that URL... -----^ private ---------------------------------------- -- Raw Streams, with 'Read and 'Write -- ---------------------------------------- type XL_Raw_Stream_Class is access all Ada.Streams.Root_Stream_Type'Class; type Font_type is new Natural; type Number_format_type is new Natural; type Format_type is new Natural; subtype XF_Range is Integer range 0..62; -- after 62 we'd need to use an IXFE (5.62) max_font : constant:= 62; max_format: constant:= 62; -- Theoretically, we would not need to memorize the XF informations -- and just give the XF identifier given with Format_type, but some -- versions of Excel with some locales mix up the font and numerical format -- when giving 0 for the cell attributes (see Cell_attributes, 2.5.13) -- Added Mar-2011. type XF_Info is record font: Font_type; numb: Number_format_type; end record; type XF_Definition is array(XF_Range) of XF_Info; -- Built-in number formats general : constant Number_format_type:= 0; decimal_0 : constant Number_format_type:= 1; decimal_2 : constant Number_format_type:= 2; decimal_0_thousands_separator: constant Number_format_type:= 3; -- 1'234'000 decimal_2_thousands_separator: constant Number_format_type:= 4; -- 1'234'000.00 no_currency_0 : constant Number_format_type:= 5; no_currency_red_0 : constant Number_format_type:= 6; no_currency_2 : constant Number_format_type:= 7; no_currency_red_2 : constant Number_format_type:= 8; currency_0 : constant Number_format_type:= 9; -- 5 in BIFF2, BIFF3 (sob!) currency_red_0 : constant Number_format_type:= 10; -- 6 in BIFF2, BIFF3... currency_2 : constant Number_format_type:= 11; currency_red_2 : constant Number_format_type:= 12; percent_0 : constant Number_format_type:= 13; -- 3%, 0%, -4% percent_2 : constant Number_format_type:= 14; scientific : constant Number_format_type:= 15; fraction_1 : constant Number_format_type:= 16; fraction_2 : constant Number_format_type:= 17; dd_mm_yyyy : constant Number_format_type:= 18; -- 14 in BIFF3, 12 in BIFF2 (re-sob!) dd_mmm_yy : constant Number_format_type:= 19; -- 15 in BIFF3, 13 in BIFF2... dd_mmm : constant Number_format_type:= 20; mmm_yy : constant Number_format_type:= 21; h_mm_AM_PM : constant Number_format_type:= 22; h_mm_ss_AM_PM : constant Number_format_type:= 23; hh_mm : constant Number_format_type:= 24; hh_mm_ss : constant Number_format_type:= 25; dd_mm_yyyy_hh_mm : constant Number_format_type:= 26; -- End of Excel built-in formats last_built_in : constant Number_format_type:= dd_mm_yyyy_hh_mm; percent_0_plus : constant Number_format_type:= 27; -- +3%, 0%, -4% percent_2_plus : constant Number_format_type:= 28; date_iso : constant Number_format_type:= 29; -- ISO 8601 format: 2014-03-16 date_h_m_iso : constant Number_format_type:= 30; -- date, hour, minutes date_h_m_s_iso : constant Number_format_type:= 31; -- date, hour, minutes, seconds -- End of our custom formats last_custom : constant Number_format_type:= date_h_m_s_iso; type Col_width_set is array(1..256) of Boolean; -- We have a concrete type as hidden ancestor of the Excel_Out_Stream root -- type. A variable of that type is initialized with default values and -- can help re-initialize a Excel_Out_Stream when re-used several times. -- See the Reset procedure in body. -- The abstract Excel_Out_Stream could have default values, but using a -- variable of this type to reset values is not Ada compliant (LRM:3.9.3(8)) -- type Excel_Out_Pre_Root_Type is tagged record xl_stream : XL_Raw_Stream_Class; format : Excel_type := Default_Excel_type; encoding : Encoding_type := Default_encoding; dimrecpos : Ada.Streams.Stream_IO.Positive_Count; maxcolumn : Positive:= 1; maxrow : Positive:= 1; fonts : Integer:= -1; -- [-1..max_font] xfs : Integer:= -1; -- [-1..XF_Range'Last] xf_in_use : XF_Range:= 0; xf_def : XF_Definition; number_fmt : Number_format_type:= last_custom; def_font : Font_type; def_fmt : Format_type; -- Default format; used for "Normal" style cma_fmt : Format_type; -- Format used for defining "Comma" style ccy_fmt : Format_type; -- Format used for defining "Currency" style pct_fmt : Format_type; -- Format used for defining "Percent" style is_created : Boolean:= False; is_closed : Boolean:= False; curr_row : Positive:= 1; curr_col : Positive:= 1; frz_panes : Boolean:= False; freeze_row : Positive; freeze_col : Positive; zoom_num : Positive:= 100; zoom_den : Positive:= 100; defcolwdth : Natural:= 0; -- 0 = not set; 1/256 of the width of the zero character std_col_width: Col_width_set:= (others => True); end record; type Excel_Out_Stream is abstract new Excel_Out_Pre_Root_Type with null record; type Font_style_single is (bold_single, italic_single, underlined_single, struck_out_single, outlined_single, shadowed_single, condensed_single, extended_single); type Font_style is array(Font_style_single) of Boolean; regular : constant Font_style:= (others => False); italic : constant Font_style:= (italic_single => True, others => False); bold : constant Font_style:= (bold_single => True, others => False); bold_italic : constant Font_style:= bold or italic; underlined : constant Font_style:= (underlined_single => True, others => False); struck_out : constant Font_style:= (struck_out_single => True, others => False); shadowed : constant Font_style:= (shadowed_single => True, others => False); condensed : constant Font_style:= (condensed_single => True, others => False); extended : constant Font_style:= (extended_single => True, others => False); type Cell_border_single is (left_single, right_single, top_single, bottom_single); type Cell_border is array(Cell_border_single) of Boolean; no_border : constant Cell_border:= (others => False); left : constant Cell_border:= (left_single => True, others => False); right : constant Cell_border:= (right_single => True, others => False); top : constant Cell_border:= (top_single => True, others => False); bottom : constant Cell_border:= (bottom_single => True, others => False); box : constant Cell_border:= (others => True); ---------------------- -- Output to a file -- ---------------------- type XL_file_acc is access Ada.Streams.Stream_IO.File_Type; type Excel_Out_File is new Excel_Out_Stream with record xl_file : XL_file_acc:= null; -- access to the "physical" Excel file end record; -- Set the index on the file procedure Set_Index (xl: in out Excel_Out_File; To: Ada.Streams.Stream_IO.Positive_Count); -- Return the index of the file function Index (xl: Excel_Out_File) return Ada.Streams.Stream_IO.Count; ------------------------ -- Output to a string -- ------------------------ -- Code reused from Zip_Streams --- *** We define here a complete in-memory stream: type Unbounded_Stream is new Ada.Streams.Root_Stream_Type with record Unb : Ada.Strings.Unbounded.Unbounded_String; Loc : Integer := 1; end record; -- Read data from the stream. procedure Read (Stream : in out Unbounded_Stream; Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset); -- write data to the stream, starting from the current index. -- Data will be overwritten from index is already available. procedure Write (Stream : in out Unbounded_Stream; Item : Ada.Streams.Stream_Element_Array); -- Set the index on the stream procedure Set_Index (S : access Unbounded_Stream; To : Positive); -- returns the index of the stream function Index (S: access Unbounded_Stream) return Integer; --- *** type Unbounded_Stream_Acc is access Unbounded_Stream; type Excel_Out_String is new Excel_Out_Stream with record xl_memory: Unbounded_Stream_Acc; end record; -- Set the index on the Excel string stream procedure Set_Index (xl: in out Excel_Out_String; To: Ada.Streams.Stream_IO.Positive_Count); -- Return the index of the Excel string stream function Index (xl: Excel_Out_String) return Ada.Streams.Stream_IO.Count; end Excel_Out;

41.599034

100

0.646808

38fd69593b11f2245e4bf0e8faab284604c80462

18,940

adb

Ada

tools-src/gnu/gcc/gcc/ada/g-dirope.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/g-dirope.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/g-dirope.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . D I R E C T O R Y _ O P E R A T I O N S -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1998-2001 Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ with Ada.Characters.Handling; with Ada.Strings.Fixed; with Ada.Strings.Maps; with Unchecked_Deallocation; with Unchecked_Conversion; with System; use System; with GNAT.OS_Lib; package body GNAT.Directory_Operations is use Ada; type Dir_Type_Value is new System.Address; -- This is the low-level address directory structure as returned by the C -- opendir routine. procedure Free is new Unchecked_Deallocation (Dir_Type_Value, Dir_Type); --------------- -- Base_Name -- --------------- function Base_Name (Path : Path_Name; Suffix : String := "") return String is function Get_File_Names_Case_Sensitive return Integer; pragma Import (C, Get_File_Names_Case_Sensitive, "__gnat_get_file_names_case_sensitive"); Case_Sensitive_File_Name : constant Boolean := Get_File_Names_Case_Sensitive = 1; function Basename (Path : Path_Name; Suffix : String := "") return String; -- This function does the job. The only difference between Basename -- and Base_Name (the parent function) is that the former is case -- sensitive, while the latter is not. Path and Suffix are adjusted -- appropriately before calling Basename under platforms where the -- file system is not case sensitive. -------------- -- Basename -- -------------- function Basename (Path : Path_Name; Suffix : String := "") return String is Cut_Start : Natural := Strings.Fixed.Index (Path, Dir_Seps, Going => Strings.Backward); Cut_End : Natural; begin -- Cut_Start point to the first basename character if Cut_Start = 0 then Cut_Start := Path'First; else Cut_Start := Cut_Start + 1; end if; -- Cut_End point to the last basename character. Cut_End := Path'Last; -- If basename ends with Suffix, adjust Cut_End. if Suffix /= "" and then Path (Path'Last - Suffix'Length + 1 .. Cut_End) = Suffix then Cut_End := Path'Last - Suffix'Length; end if; Check_For_Standard_Dirs : declare Offset : constant Integer := Path'First - Base_Name.Path'First; BN : constant String := Base_Name.Path (Cut_Start - Offset .. Cut_End - Offset); -- Here we use Base_Name.Path to keep the original casing begin if BN = "." or else BN = ".." then return ""; elsif BN'Length > 2 and then Characters.Handling.Is_Letter (BN (BN'First)) and then BN (BN'First + 1) = ':' then -- We have a DOS drive letter prefix, remove it return BN (BN'First + 2 .. BN'Last); else return BN; end if; end Check_For_Standard_Dirs; end Basename; -- Start processing for Base_Name begin if Case_Sensitive_File_Name then return Basename (Path, Suffix); else return Basename (Characters.Handling.To_Lower (Path), Characters.Handling.To_Lower (Suffix)); end if; end Base_Name; ---------------- -- Change_Dir -- ---------------- procedure Change_Dir (Dir_Name : Dir_Name_Str) is C_Dir_Name : String := Dir_Name & ASCII.NUL; function chdir (Dir_Name : String) return Integer; pragma Import (C, chdir, "chdir"); begin if chdir (C_Dir_Name) /= 0 then raise Directory_Error; end if; end Change_Dir; ----------- -- Close -- ----------- procedure Close (Dir : in out Dir_Type) is function closedir (Directory : System.Address) return Integer; pragma Import (C, closedir, "closedir"); Discard : Integer; begin if not Is_Open (Dir) then raise Directory_Error; end if; Discard := closedir (System.Address (Dir.all)); Free (Dir); end Close; -------------- -- Dir_Name -- -------------- function Dir_Name (Path : Path_Name) return Dir_Name_Str is Last_DS : constant Natural := Strings.Fixed.Index (Path, Dir_Seps, Going => Strings.Backward); begin if Last_DS = 0 then -- There is no directory separator, returns current working directory return "." & Dir_Separator; else return Path (Path'First .. Last_DS); end if; end Dir_Name; ----------------- -- Expand_Path -- ----------------- function Expand_Path (Path : Path_Name) return String is Result : OS_Lib.String_Access := new String (1 .. 200); Result_Last : Natural := 0; procedure Append (C : Character); procedure Append (S : String); -- Append to Result procedure Double_Result_Size; -- Reallocate Result, doubling its size procedure Read (K : in out Positive); -- Update Result while reading current Path starting at position K. If -- a variable is found, call Var below. procedure Var (K : in out Positive); -- Translate variable name starting at position K with the associated -- environment value. ------------ -- Append -- ------------ procedure Append (C : Character) is begin if Result_Last = Result'Last then Double_Result_Size; end if; Result_Last := Result_Last + 1; Result (Result_Last) := C; end Append; procedure Append (S : String) is begin while Result_Last + S'Length - 1 > Result'Last loop Double_Result_Size; end loop; Result (Result_Last + 1 .. Result_Last + S'Length) := S; Result_Last := Result_Last + S'Length; end Append; ------------------------ -- Double_Result_Size -- ------------------------ procedure Double_Result_Size is New_Result : constant OS_Lib.String_Access := new String (1 .. 2 * Result'Last); begin New_Result (1 .. Result_Last) := Result (1 .. Result_Last); OS_Lib.Free (Result); Result := New_Result; end Double_Result_Size; ---------- -- Read -- ---------- procedure Read (K : in out Positive) is begin For_All_Characters : loop if Path (K) = '$' then -- Could be a variable if K < Path'Last then if Path (K + 1) = '$' then -- Not a variable after all, this is a double $, just -- insert one in the result string. Append ('$'); K := K + 1; else -- Let's parse the variable K := K + 1; Var (K); end if; else -- We have an ending $ sign Append ('$'); end if; else -- This is a standard character, just add it to the result Append (Path (K)); end if; -- Skip to next character K := K + 1; exit For_All_Characters when K > Path'Last; end loop For_All_Characters; end Read; --------- -- Var -- --------- procedure Var (K : in out Positive) is E : Positive; begin if Path (K) = '{' then -- Look for closing } (curly bracket). E := K; loop E := E + 1; exit when Path (E) = '}' or else E = Path'Last; end loop; if Path (E) = '}' then -- OK found, translate with environment value declare Env : OS_Lib.String_Access := OS_Lib.Getenv (Path (K + 1 .. E - 1)); begin Append (Env.all); OS_Lib.Free (Env); end; else -- No closing curly bracket, not a variable after all or a -- syntax error, ignore it, insert string as-is. Append ('$'); Append (Path (K .. E)); end if; else -- The variable name is everything from current position to first -- non letter/digit character. E := K; -- Check that first chartacter is a letter if Characters.Handling.Is_Letter (Path (E)) then E := E + 1; Var_Name : loop exit Var_Name when E > Path'Last; if Characters.Handling.Is_Letter (Path (E)) or else Characters.Handling.Is_Digit (Path (E)) then E := E + 1; else exit Var_Name; end if; end loop Var_Name; E := E - 1; declare Env : OS_Lib.String_Access := OS_Lib.Getenv (Path (K .. E)); begin Append (Env.all); OS_Lib.Free (Env); end; else -- This is not a variable after all Append ('$'); Append (Path (E)); end if; end if; K := E; end Var; -- Start of processing for Expand_Path begin declare K : Positive := Path'First; begin Read (K); declare Returned_Value : constant String := Result (1 .. Result_Last); begin OS_Lib.Free (Result); return Returned_Value; end; end; end Expand_Path; -------------------- -- File_Extension -- -------------------- function File_Extension (Path : Path_Name) return String is First : Natural := Strings.Fixed.Index (Path, Dir_Seps, Going => Strings.Backward); Dot : Natural; begin if First = 0 then First := Path'First; end if; Dot := Strings.Fixed.Index (Path (First .. Path'Last), ".", Going => Strings.Backward); if Dot = 0 or else Dot = Path'Last then return ""; else return Path (Dot .. Path'Last); end if; end File_Extension; --------------- -- File_Name -- --------------- function File_Name (Path : Path_Name) return String is begin return Base_Name (Path); end File_Name; --------------------- -- Get_Current_Dir -- --------------------- Max_Path : Integer; pragma Import (C, Max_Path, "max_path_len"); function Get_Current_Dir return Dir_Name_Str is Current_Dir : String (1 .. Max_Path + 1); Last : Natural; begin Get_Current_Dir (Current_Dir, Last); return Current_Dir (1 .. Last); end Get_Current_Dir; procedure Get_Current_Dir (Dir : out Dir_Name_Str; Last : out Natural) is Path_Len : Natural := Max_Path; Buffer : String (Dir'First .. Dir'First + Max_Path + 1); procedure Local_Get_Current_Dir (Dir : System.Address; Length : System.Address); pragma Import (C, Local_Get_Current_Dir, "__gnat_get_current_dir"); begin Local_Get_Current_Dir (Buffer'Address, Path_Len'Address); if Dir'Length > Path_Len then Last := Dir'First + Path_Len - 1; else Last := Dir'Last; end if; Dir (Buffer'First .. Last) := Buffer (Buffer'First .. Last); end Get_Current_Dir; ------------- -- Is_Open -- ------------- function Is_Open (Dir : Dir_Type) return Boolean is begin return Dir /= Null_Dir and then System.Address (Dir.all) /= System.Null_Address; end Is_Open; -------------- -- Make_Dir -- -------------- procedure Make_Dir (Dir_Name : Dir_Name_Str) is C_Dir_Name : String := Dir_Name & ASCII.NUL; function mkdir (Dir_Name : String) return Integer; pragma Import (C, mkdir, "__gnat_mkdir"); begin if mkdir (C_Dir_Name) /= 0 then raise Directory_Error; end if; end Make_Dir; ------------------------ -- Normalize_Pathname -- ------------------------ function Normalize_Pathname (Path : Path_Name; Style : Path_Style := System_Default) return String is N_Path : String := Path; K : Positive := N_Path'First; Prev_Dirsep : Boolean := False; begin for J in Path'Range loop if Strings.Maps.Is_In (Path (J), Dir_Seps) then if not Prev_Dirsep then case Style is when UNIX => N_Path (K) := '/'; when DOS => N_Path (K) := '\'; when System_Default => N_Path (K) := Dir_Separator; end case; K := K + 1; end if; Prev_Dirsep := True; else N_Path (K) := Path (J); K := K + 1; Prev_Dirsep := False; end if; end loop; return N_Path (N_Path'First .. K - 1); end Normalize_Pathname; ---------- -- Open -- ---------- procedure Open (Dir : out Dir_Type; Dir_Name : Dir_Name_Str) is C_File_Name : String := Dir_Name & ASCII.NUL; function opendir (File_Name : String) return Dir_Type_Value; pragma Import (C, opendir, "opendir"); begin Dir := new Dir_Type_Value'(opendir (C_File_Name)); if not Is_Open (Dir) then Free (Dir); Dir := Null_Dir; raise Directory_Error; end if; end Open; ---------- -- Read -- ---------- procedure Read (Dir : in out Dir_Type; Str : out String; Last : out Natural) is Filename_Addr : Address; Filename_Len : Integer; Buffer : array (0 .. 1024) of Character; -- 1024 is the value of FILENAME_MAX in stdio.h function readdir_gnat (Directory : System.Address; Buffer : System.Address) return System.Address; pragma Import (C, readdir_gnat, "__gnat_readdir"); function strlen (S : Address) return Integer; pragma Import (C, strlen, "strlen"); begin if not Is_Open (Dir) then raise Directory_Error; end if; Filename_Addr := readdir_gnat (System.Address (Dir.all), Buffer'Address); if Filename_Addr = System.Null_Address then Last := 0; return; end if; Filename_Len := strlen (Filename_Addr); if Str'Length > Filename_Len then Last := Str'First + Filename_Len - 1; else Last := Str'Last; end if; declare subtype Path_String is String (1 .. Filename_Len); type Path_String_Access is access Path_String; function Address_To_Access is new Unchecked_Conversion (Source => Address, Target => Path_String_Access); Path_Access : Path_String_Access := Address_To_Access (Filename_Addr); begin for J in Str'First .. Last loop Str (J) := Path_Access (J - Str'First + 1); end loop; end; end Read; ------------------------- -- Read_Is_Thread_Sage -- ------------------------- function Read_Is_Thread_Safe return Boolean is function readdir_is_thread_safe return Integer; pragma Import (C, readdir_is_thread_safe, "__gnat_readdir_is_thread_safe"); begin return (readdir_is_thread_safe /= 0); end Read_Is_Thread_Safe; ---------------- -- Remove_Dir -- ---------------- procedure Remove_Dir (Dir_Name : Dir_Name_Str) is C_Dir_Name : String := Dir_Name & ASCII.NUL; procedure rmdir (Dir_Name : String); pragma Import (C, rmdir, "rmdir"); begin rmdir (C_Dir_Name); end Remove_Dir; end GNAT.Directory_Operations;

27.771261

79

0.494931

a05ec19a1e039b4ac6bc64e4338a8978caad6b09

1,598

ads

Ada

tier-1/xcb/source/thin/xcb-xcb_glx_destroy_glx_pixmap_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

tier-1/xcb/source/thin/xcb-xcb_glx_destroy_glx_pixmap_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

tier-1/xcb/source/thin/xcb-xcb_glx_destroy_glx_pixmap_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_destroy_glx_pixmap_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; minor_opcode : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; glx_pixmap : aliased xcb.xcb_glx_pixmap_t; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_destroy_glx_pixmap_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_destroy_glx_pixmap_request_t.Item, Element_Array => xcb.xcb_glx_destroy_glx_pixmap_request_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_destroy_glx_pixmap_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_destroy_glx_pixmap_request_t.Pointer, Element_Array => xcb.xcb_glx_destroy_glx_pixmap_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_destroy_glx_pixmap_request_t;

28.535714

79

0.68836

9a80548c6424be6478a427d22f73a518e3535eca

10,421

ads

Ada

source/league/ucd/matreshka-internals-unicode-ucd-core_0116.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_0116.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_0116.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2015, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ pragma Restrictions (No_Elaboration_Code); -- GNAT: enforce generation of preinitialized data section instead of -- generation of elaboration code. package Matreshka.Internals.Unicode.Ucd.Core_0116 is pragma Preelaborate; Group_0116 : aliased constant Core_Second_Stage := (16#00# .. 16#2F# => -- 011600 .. 01162F (Other_Letter, Neutral, Other, A_Letter, O_Letter, Alphabetic, (Alphabetic | Grapheme_Base | ID_Continue | ID_Start | XID_Continue | XID_Start => True, others => False)), 16#30# .. 16#32# => -- 011630 .. 011632 (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#33# .. 16#3A# => -- 011633 .. 01163A (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#3B# .. 16#3C# => -- 01163B .. 01163C (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#3D# => -- 01163D (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#3E# => -- 01163E (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#3F# => -- 01163F (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Diacritic | Case_Ignorable | Grapheme_Extend | Grapheme_Link | ID_Continue | XID_Continue => True, others => False)), 16#40# => -- 011640 (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#41# .. 16#42# => -- 011641 .. 011642 (Other_Punctuation, Neutral, Other, Other, S_Term, Break_After, (STerm | Terminal_Punctuation | Grapheme_Base => True, others => False)), 16#43# => -- 011643 (Other_Punctuation, Neutral, Other, Other, Other, Alphabetic, (Grapheme_Base => True, others => False)), 16#44# => -- 011644 (Other_Letter, Neutral, Other, A_Letter, O_Letter, Alphabetic, (Alphabetic | Grapheme_Base | ID_Continue | ID_Start | XID_Continue | XID_Start => True, others => False)), 16#50# .. 16#59# => -- 011650 .. 011659 (Decimal_Number, Neutral, Other, Numeric, Numeric, Numeric, (Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#80# .. 16#AA# => -- 011680 .. 0116AA (Other_Letter, Neutral, Other, A_Letter, O_Letter, Alphabetic, (Alphabetic | Grapheme_Base | ID_Continue | ID_Start | XID_Continue | XID_Start => True, others => False)), 16#AB# => -- 0116AB (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#AC# => -- 0116AC (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#AD# => -- 0116AD (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#AE# .. 16#AF# => -- 0116AE .. 0116AF (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), 16#B0# .. 16#B5# => -- 0116B0 .. 0116B5 (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#B6# => -- 0116B6 (Spacing_Mark, Neutral, Spacing_Mark, Extend, Extend, Combining_Mark, (Diacritic | Grapheme_Base | Grapheme_Link | ID_Continue | XID_Continue => True, others => False)), 16#B7# => -- 0116B7 (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Diacritic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#C0# .. 16#C9# => -- 0116C0 .. 0116C9 (Decimal_Number, Neutral, Other, Numeric, Numeric, Numeric, (Grapheme_Base | ID_Continue | XID_Continue => True, others => False)), others => (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False))); end Matreshka.Internals.Unicode.Ucd.Core_0116;

41.851406

78

0.448997

4bfdc7e5852bd5870c8dc305ecf3511870a4993f

3,149

ads

Ada

tools/scitools/conf/understand/ada/ada05/s-pack56.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/s-pack56.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/s-pack56.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 5 6 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 56 package System.Pack_56 is pragma Preelaborate; Bits : constant := 56; type Bits_56 is mod 2 ** Bits; for Bits_56'Size use Bits; function Get_56 (Arr : System.Address; N : Natural) return Bits_56; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_56 (Arr : System.Address; N : Natural; E : Bits_56); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. function GetU_56 (Arr : System.Address; N : Natural) return Bits_56; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. This version -- is used when Arr may represent an unaligned address. procedure SetU_56 (Arr : System.Address; N : Natural; E : Bits_56); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. This version -- is used when Arr may represent an unaligned address end System.Pack_56;

49.984127

78

0.485551

04689886559bc67f8e25a80919df4ce604471822

1,297

ada

Ada

Task/Bitwise-IO/Ada/bitwise-io-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Bitwise-IO/Ada/bitwise-io-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Bitwise-IO/Ada/bitwise-io-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

package body Bit_Streams is procedure Finalize (Stream : in out Bit_Stream) is begin if Stream.Write_Count > 0 then Stream.Output (1) := Stream.Output (1) * 2**(Stream_Element'Size - Stream.Write_Count); Stream.Channel.Write (Stream.Output); end if; end Finalize; procedure Read (Stream : in out Bit_Stream; Data : out Bit_Array) is Last : Stream_Element_Offset; begin for Index in Data'Range loop if Stream.Read_Count = 0 then Stream.Channel.Read (Stream.Input, Last); Stream.Read_Count := Stream_Element'Size; end if; Data (Index) := Bit (Stream.Input (1) / 2**(Stream_Element'Size - 1)); Stream.Input (1) := Stream.Input (1) * 2; Stream.Read_Count := Stream.Read_Count - 1; end loop; end Read; procedure Write (Stream : in out Bit_Stream; Data : Bit_Array) is begin for Index in Data'Range loop if Stream.Write_Count = Stream_Element'Size then Stream.Channel.Write (Stream.Output); Stream.Write_Count := 0; end if; Stream.Output (1) := Stream.Output (1) * 2 or Stream_Element (Data (Index)); Stream.Write_Count := Stream.Write_Count + 1; end loop; end Write; end Bit_Streams;

38.147059

96

0.619892

a097a725811c8069df3e3b34bde0d9a359e1a39d

836

adb

Ada

gnu/src/gdb/gdb/testsuite/gdb.ada/addr_arith/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/addr_arith/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/addr_arith/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

-- Copyright 2014-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- 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 -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is procedure Increment (I : in out Integer) is begin I := I + 1; end Increment; end Pck;

38

73

0.721292

8b5fb3098fbfeb08bff16e53aa8ebd55cbbbad7c

3,562

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/s-conca6.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/s-conca6.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/s-conca6.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . C O N C A T _ 6 -- -- -- -- B o d y -- -- -- -- Copyright (C) 2008-2013, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; with System.Concat_5; package body System.Concat_6 is pragma Suppress (All_Checks); ------------------ -- Str_Concat_6 -- ------------------ procedure Str_Concat_6 (R : out String; S1, S2, S3, S4, S5, S6 : String) is F, L : Natural; begin F := R'First; L := F + S1'Length - 1; R (F .. L) := S1; F := L + 1; L := F + S2'Length - 1; R (F .. L) := S2; F := L + 1; L := F + S3'Length - 1; R (F .. L) := S3; F := L + 1; L := F + S4'Length - 1; R (F .. L) := S4; F := L + 1; L := F + S5'Length - 1; R (F .. L) := S5; F := L + 1; L := R'Last; R (F .. L) := S6; end Str_Concat_6; ------------------------- -- Str_Concat_Bounds_6 -- ------------------------- procedure Str_Concat_Bounds_6 (Lo, Hi : out Natural; S1, S2, S3, S4, S5, S6 : String) is begin System.Concat_5.Str_Concat_Bounds_5 (Lo, Hi, S2, S3, S4, S5, S6); if S1 /= "" then Hi := S1'Last + Hi - Lo + 1; Lo := S1'First; end if; end Str_Concat_Bounds_6; end System.Concat_6;

39.142857

78

0.388827

57861197fa725e5180a26d6fbd9976cb47f1b37a

24,934

ads

Ada

src/base/beans/util-beans-objects.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

60

2015-01-18T23:05:34.000Z

2022-03-20T18:56:30.000Z

src/base/beans/util-beans-objects.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

20

2016-09-15T16:41:30.000Z

2022-03-29T22:02:32.000Z

src/base/beans/util-beans-objects.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

10

2015-02-13T04:00:45.000Z

2022-03-20T18:57:54.000Z

----------------------------------------------------------------------- -- util-beans-objects -- Generic Typed Data Representation -- Copyright (C) 2009, 2010, 2011, 2013, 2017, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- == Objects == -- The `Util.Beans.Objects` package provides a data type to manage entities of different types -- by using the same abstraction. The `Object` type allows to hold various values of different -- types. -- -- An `Object` can hold one of the following values: -- -- * a boolean, -- * a long long integer, -- * a date, -- * a string, -- * a wide wide string, -- * a generic data -- -- Several operations are provided to convert a value into an `Object`. -- -- Value : Util.Beans.Objects.Object := Util.Beans.Objects.To_Object ("something"); -- Value := Value + To_Object ("12"); -- with Ada.Strings.Unbounded; with Ada.Strings.Wide_Wide_Unbounded; with Ada.Finalization; private with Util.Concurrent.Counters; limited with Util.Beans.Basic; package Util.Beans.Objects is pragma Preelaborate; use Ada.Strings.Unbounded; use Ada.Strings.Wide_Wide_Unbounded; -- Exception raised when an object cannot be converted to a given type. Conversion_Error : exception; type Data_Type is (TYPE_NULL, -- The object holds a boolean value. TYPE_BOOLEAN, -- The object holds an integer value (64-bits). TYPE_INTEGER, -- The object holds a floating point value. TYPE_FLOAT, -- The object holds a date and time. TYPE_TIME, -- The object holds a string. TYPE_STRING, -- The object holds a wide wide string. TYPE_WIDE_STRING, -- The object holds an array of objects. TYPE_ARRAY, -- The object holds a generic bean. TYPE_BEAN); type Storage_Type is (STATIC, DYNAMIC); -- Exception raised when the value identified by a name is not -- recognized. No_Value : exception; -- ------------------------------ -- Generic Object holding a value -- ------------------------------ -- The object has a type represented by 'Object_Type'. -- It can hold any value while being tightly coupled with a type. -- The object can be converted to standard Ada types. type Object is private; type Object_Value is private; -- An array of objects. type Object_Array is array (Positive range <>) of Object; -- The null object. Null_Object : constant Object; -- ------------------------------ -- Type definition -- ------------------------------ -- The Object_Type describes a type. It serves as a basis -- for type conversion. type Object_Type is limited interface; type Object_Type_Access is not null access constant Object_Type'Class; -- Get the type name function Get_Name (Type_Def : Object_Type) return String is abstract; -- Get the base data type. function Get_Data_Type (Type_Def : Object_Type) return Data_Type is abstract; -- Convert the value into a string. function To_String (Type_Def : in Object_Type; Value : in Object_Value) return String is abstract; -- Convert the value into a wide string. function To_Wide_Wide_String (Type_Def : in Object_Type; Value : in Object_Value) return Wide_Wide_String is abstract; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Object_Type; Value : in Object_Value) return Long_Long_Integer is abstract; -- Convert the value into a float. function To_Long_Float (Type_Def : in Object_Type; Value : in Object_Value) return Long_Long_Float is abstract; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Object_Type; Value : in Object_Value) return Boolean is abstract; -- Convert the value into a duration. function To_Duration (Type_Def : in Object_Type; Value : in Object_Value) return Duration is abstract; -- Returns True if the value is empty. function Is_Empty (Type_Def : in Object_Type; Value : in Object_Value) return Boolean is abstract; -- ------------------------------ -- Generic Object holding a value -- ------------------------------ -- Check whether the object contains a value. -- Returns true if the object does not contain a value. function Is_Null (Value : in Object) return Boolean; -- Check whether the object is empty. -- If the object is null, returns true. -- If the object is the empty string, returns true. -- If the object is a list bean whose Get_Count is 0, returns true. -- Otherwise returns false. function Is_Empty (Value : in Object) return Boolean; -- Returns True if the object is an array. function Is_Array (Value : in Object) return Boolean; -- Get a type identification for the object value. function Get_Type (Value : in Object) return Data_Type; -- Get the type definition of the object value. function Get_Type (Value : in Object) return Object_Type_Access; -- Get the type name of this object. function Get_Type_Name (Value : Object) return String; -- Get the value identified by the name in the bean object. -- If the value object is not a bean, returns the null object. function Get_Value (Value : in Object; Name : in String) return Object; -- Set into the target object a value identified by the name. -- The target object must be a <tt>Bean</tt> instance that implements the <tt>Set_Value</tt> -- procedure. The operation does nothing if this is not the case. procedure Set_Value (Into : in Object; Name : in String; Value : in Object); -- Get the number of elements in the array object. -- Returns 0 if the object is not an array. function Get_Count (From : in Object) return Natural; -- Get the array element at the given position. function Get_Value (From : in Object; Position : in Positive) return Object; -- Convert the object to the corresponding type. function To_String (Value : in Object) return String; function To_Wide_Wide_String (Value : in Object) return Wide_Wide_String; function To_Unbounded_String (Value : in Object) return Unbounded_String; function To_Unbounded_Wide_Wide_String (Value : in Object) return Unbounded_Wide_Wide_String; function To_Integer (Value : in Object) return Integer; function To_Boolean (Value : in Object) return Boolean; function To_Long_Integer (Value : in Object) return Long_Integer; function To_Long_Long_Integer (Value : in Object) return Long_Long_Integer; function To_Float (Value : in Object) return Float; function To_Long_Float (Value : in Object) return Long_Float; function To_Long_Long_Float (Value : in Object) return Long_Long_Float; function To_Duration (Value : in Object) return Duration; function To_Bean (Value : in Object) return access Util.Beans.Basic.Readonly_Bean'Class; -- Convert the object to an object of another time. -- Force the object to be an integer. function Cast_Integer (Value : Object) return Object; -- Force the object to be a float. function Cast_Float (Value : Object) return Object; -- Force the object to be a duration. function Cast_Duration (Value : Object) return Object; -- Force the object to be a string. function Cast_String (Value : Object) return Object; -- Convert a value to a generic typed object. function To_Object (Value : in Integer) return Object; function To_Object (Value : in Long_Integer) return Object; function To_Object (Value : in Long_Long_Integer) return Object; function To_Object (Value : in Float) return Object; function To_Object (Value : in Long_Float) return Object; function To_Object (Value : in Long_Long_Float) return Object; function To_Object (Value : in String) return Object; function To_Object (Value : in Wide_Wide_String) return Object; function To_Object (Value : in Unbounded_String) return Object; function To_Object (Value : in Unbounded_Wide_Wide_String) return Object; function To_Object (Value : in Boolean) return Object; function To_Object (Value : in Duration) return Object; function To_Object (Value : in Object_Array) return Object; -- Create an object that refers to the bean object. With the storage type -- DYNAMIC, the default, the bean object will be freed when there is -- no Object that refers to that bean. With STATIC, the bean -- is a static bean and it will not be freed automaticaly. function To_Object (Value : access Util.Beans.Basic.Readonly_Bean'Class; Storage : in Storage_Type := DYNAMIC) return Object; -- Comparison of objects function "<" (Left, Right : Object) return Boolean; function "<=" (Left, Right : Object) return Boolean; function ">" (Left, Right : Object) return Boolean; function ">=" (Left, Right : Object) return Boolean; function "=" (Left, Right : Object) return Boolean; -- Arithmetic operations on objects function "+" (Left, Right : Object) return Object; function "-" (Left, Right : Object) return Object; function "*" (Left, Right : Object) return Object; function "/" (Left, Right : Object) return Object; function "&" (Left, Right : Object) return Object; function "mod" (Left, Right : Object) return Object; function "-" (Left : Object) return Object; private use Ada.Finalization; type Name_Access is access constant String; type Basic_Type is abstract limited new Object_Type with null record; -- Convert the value into a wide string. function To_Wide_Wide_String (Type_Def : in Basic_Type; Value : in Object_Value) return Wide_Wide_String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Basic_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Basic_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Basic_Type; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in Basic_Type; Value : in Object_Value) return Duration; -- Returns False function Is_Empty (Type_Def : in Basic_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Null Type -- ------------------------------ type Null_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : Null_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : Null_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Null_Type; Value : in Object_Value) return String; -- Returns True function Is_Empty (Type_Def : in Null_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Integer Type -- ------------------------------ type Int_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : Int_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : Int_Type) return Data_Type; function To_String (Type_Def : in Int_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Int_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Int_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Int_Type; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in Int_Type; Value : in Object_Value) return Duration; -- ------------------------------ -- Float Type -- ------------------------------ type Float_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Float_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Float_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Float_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Float_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Float_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Float_Type; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in Float_Type; Value : in Object_Value) return Duration; -- ------------------------------ -- String Type -- ------------------------------ type String_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in String_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in String_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in String_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in String_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in String_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in String_Type; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in String_Type; Value : in Object_Value) return Duration; -- Returns True if the value is empty. function Is_Empty (Type_Def : in String_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Wide String Type -- ------------------------------ type Wide_String_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Wide_String_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Wide_String_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Wide_String_Type; Value : in Object_Value) return String; -- Convert the value into a wide string. function To_Wide_Wide_String (Type_Def : in Wide_String_Type; Value : in Object_Value) return Wide_Wide_String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Wide_String_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Wide_String_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Wide_String_Type; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in Wide_String_Type; Value : in Object_Value) return Duration; -- Returns True if the value is empty. function Is_Empty (Type_Def : in Wide_String_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Boolean Type -- ------------------------------ type Boolean_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Boolean_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Boolean_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Boolean_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Boolean_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Boolean_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Boolean_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Duration Type -- ------------------------------ type Duration_Type_Def is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Duration_Type_Def) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Duration_Type_Def) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Duration_Type_Def; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Duration_Type_Def; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Duration_Type_Def; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Duration_Type_Def; Value : in Object_Value) return Boolean; -- Convert the value into a duration. function To_Duration (Type_Def : in Duration_Type_Def; Value : in Object_Value) return Duration; -- ------------------------------ -- Bean Type -- ------------------------------ type Bean_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Bean_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Bean_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Bean_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Bean_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Bean_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Bean_Type; Value : in Object_Value) return Boolean; -- Returns True if the value is empty. function Is_Empty (Type_Def : in Bean_Type; Value : in Object_Value) return Boolean; -- ------------------------------ -- Array Type -- ------------------------------ type Array_Type is new Basic_Type with null record; -- Get the type name function Get_Name (Type_Def : in Array_Type) return String; -- Get the base data type. function Get_Data_Type (Type_Def : in Array_Type) return Data_Type; -- Convert the value into a string. function To_String (Type_Def : in Array_Type; Value : in Object_Value) return String; -- Convert the value into an integer. function To_Long_Long (Type_Def : in Array_Type; Value : in Object_Value) return Long_Long_Integer; -- Convert the value into a float. function To_Long_Float (Type_Def : in Array_Type; Value : in Object_Value) return Long_Long_Float; -- Convert the value into a boolean. function To_Boolean (Type_Def : in Array_Type; Value : in Object_Value) return Boolean; -- Returns True if the value is empty. function Is_Empty (Type_Def : in Array_Type; Value : in Object_Value) return Boolean; function Get_Array_Bean (Value : in Object) return access Util.Beans.Basic.Array_Bean'Class; subtype Proxy_Data_Type is Data_Type range TYPE_STRING .. TYPE_BEAN; type Proxy is tagged limited record Ref_Counter : Util.Concurrent.Counters.Counter; end record; -- Release the object pointed to by the proxy (if necessary). procedure Release (P : in out Proxy) is null; type Bean_Proxy_Access is access all Proxy'Class; type String_Proxy (Len : Natural) is new Proxy with record Value : String (1 .. Len); end record; type String_Proxy_Access is access all String_Proxy; type Wide_String_Proxy (Len : Natural) is new Proxy with record Value : Wide_Wide_String (1 .. Len); end record; type Wide_String_Proxy_Access is access all Wide_String_Proxy; type Bean_Proxy is new Proxy with record Bean : access Util.Beans.Basic.Readonly_Bean'Class; Storage : Storage_Type; end record; type Array_Proxy (Len : Natural) is new Proxy with record Count : Natural := 0; Values : Object_Array (1 .. Len); end record; type Array_Proxy_Access is access all Array_Proxy; -- Release the object pointed to by the proxy (if necessary). overriding procedure Release (P : in out Bean_Proxy); type Object_Value (Of_Type : Data_Type := TYPE_NULL) is record case Of_Type is when TYPE_NULL => null; -- Integers and enums are stored as 64-bit integer. when TYPE_INTEGER => Int_Value : Long_Long_Integer; when TYPE_BOOLEAN => Bool_Value : Boolean; when TYPE_FLOAT => Float_Value : Long_Long_Float; when TYPE_TIME => Time_Value : Duration; when TYPE_STRING => String_Proxy : String_Proxy_Access; when TYPE_WIDE_STRING => Wide_Proxy : Wide_String_Proxy_Access; when TYPE_ARRAY => Array_Proxy : Array_Proxy_Access; when TYPE_BEAN => Proxy : Bean_Proxy_Access; end case; end record; No_Type : aliased constant Null_Type := Null_Type '(null record); Null_Value : constant Object_Value := Object_Value '(Of_Type => TYPE_NULL); type Object is new Controlled with record Type_Def : Object_Type_Access := No_Type'Access; V : Object_Value := Null_Value; end record; overriding procedure Adjust (Obj : in out Object); overriding procedure Finalize (Obj : in out Object); Null_Object : constant Object := Object '(Controlled with V => Object_Value '(Of_Type => TYPE_NULL), Type_Def => No_Type'Access); end Util.Beans.Objects;

38.657364

97

0.625612

0401daefa18ea731e52fec17fc35c2a706b4a3bf

3,944

adb

Ada

examples/translator/hello.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

examples/translator/hello.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

examples/translator/hello.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Examples Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with League.Strings; with League.Translator; with Put_Line; procedure Hello is function "-" (Item : Wide_Wide_String) return League.Strings.Universal_String; --------- -- "-" -- --------- function "-" (Item : Wide_Wide_String) return League.Strings.Universal_String is begin return League.Translator.Translate (League.Strings.To_Universal_String ("HELLO"), League.Strings.To_Universal_String (Item)); end "-"; begin League.Translator.Initialize ("hello.xlf"); Put_Line (-"Hello, world!"); League.Translator.Finalize; end Hello;

55.549296

78

0.434584

a01764fa37ce2e9953cc77d523429daec8f9546b

11,304

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-valllu.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-valllu.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-valllu.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . V A L _ L L U -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Unsigned_Types; use System.Unsigned_Types; with System.Val_Util; use System.Val_Util; package body System.Val_LLU is --------------------------------- -- Scan_Raw_Long_Long_Unsigned -- --------------------------------- function Scan_Raw_Long_Long_Unsigned (Str : String; Ptr : not null access Integer; Max : Integer) return Long_Long_Unsigned is P : Integer; -- Local copy of the pointer Uval : Long_Long_Unsigned; -- Accumulated unsigned integer result Expon : Integer; -- Exponent value Overflow : Boolean := False; -- Set True if overflow is detected at any point Base_Char : Character; -- Base character (# or :) in based case Base : Long_Long_Unsigned := 10; -- Base value (reset in based case) Digit : Long_Long_Unsigned; -- Digit value begin -- We do not tolerate strings with Str'Last = Positive'Last if Str'Last = Positive'Last then raise Program_Error with "string upper bound is Positive'Last, not supported"; end if; P := Ptr.all; Uval := Character'Pos (Str (P)) - Character'Pos ('0'); P := P + 1; -- Scan out digits of what is either the number or the base. -- In either case, we are definitely scanning out in base 10. declare Umax : constant := (Long_Long_Unsigned'Last - 9) / 10; -- Max value which cannot overflow on accumulating next digit Umax10 : constant := Long_Long_Unsigned'Last / 10; -- Numbers bigger than Umax10 overflow if multiplied by 10 begin -- Loop through decimal digits loop exit when P > Max; Digit := Character'Pos (Str (P)) - Character'Pos ('0'); -- Non-digit encountered if Digit > 9 then if Str (P) = '_' then Scan_Underscore (Str, P, Ptr, Max, False); else exit; end if; -- Accumulate result, checking for overflow else if Uval <= Umax then Uval := 10 * Uval + Digit; elsif Uval > Umax10 then Overflow := True; else Uval := 10 * Uval + Digit; if Uval < Umax10 then Overflow := True; end if; end if; P := P + 1; end if; end loop; end; Ptr.all := P; -- Deal with based case. We recognize either the standard '#' or the -- allowed alternative replacement ':' (see RM J.2(3)). if P < Max and then (Str (P) = '#' or else Str (P) = ':') then Base_Char := Str (P); P := P + 1; Base := Uval; Uval := 0; -- Check base value. Overflow is set True if we find a bad base, or -- a digit that is out of range of the base. That way, we scan out -- the numeral that is still syntactically correct, though illegal. -- We use a safe base of 16 for this scan, to avoid zero divide. if Base not in 2 .. 16 then Overflow := True; Base := 16; end if; -- Scan out based integer declare Umax : constant Long_Long_Unsigned := (Long_Long_Unsigned'Last - Base + 1) / Base; -- Max value which cannot overflow on accumulating next digit UmaxB : constant Long_Long_Unsigned := Long_Long_Unsigned'Last / Base; -- Numbers bigger than UmaxB overflow if multiplied by base begin -- Loop to scan out based integer value loop -- We require a digit at this stage if Str (P) in '0' .. '9' then Digit := Character'Pos (Str (P)) - Character'Pos ('0'); elsif Str (P) in 'A' .. 'F' then Digit := Character'Pos (Str (P)) - (Character'Pos ('A') - 10); elsif Str (P) in 'a' .. 'f' then Digit := Character'Pos (Str (P)) - (Character'Pos ('a') - 10); -- If we don't have a digit, then this is not a based number -- after all, so we use the value we scanned out as the base -- (now in Base), and the pointer to the base character was -- already stored in Ptr.all. else Uval := Base; exit; end if; -- If digit is too large, just signal overflow and continue. -- The idea here is to keep scanning as long as the input is -- syntactically valid, even if we have detected overflow if Digit >= Base then Overflow := True; -- Here we accumulate the value, checking overflow elsif Uval <= Umax then Uval := Base * Uval + Digit; elsif Uval > UmaxB then Overflow := True; else Uval := Base * Uval + Digit; if Uval < UmaxB then Overflow := True; end if; end if; -- If at end of string with no base char, not a based number -- but we signal Constraint_Error and set the pointer past -- the end of the field, since this is what the ACVC tests -- seem to require, see CE3704N, line 204. P := P + 1; if P > Max then Ptr.all := P; Bad_Value (Str); end if; -- If terminating base character, we are done with loop if Str (P) = Base_Char then Ptr.all := P + 1; exit; -- Deal with underscore elsif Str (P) = '_' then Scan_Underscore (Str, P, Ptr, Max, True); end if; end loop; end; end if; -- Come here with scanned unsigned value in Uval. The only remaining -- required step is to deal with exponent if one is present. Expon := Scan_Exponent (Str, Ptr, Max); if Expon /= 0 and then Uval /= 0 then -- For non-zero value, scale by exponent value. No need to do this -- efficiently, since use of exponent in integer literals is rare, -- and in any case the exponent cannot be very large. declare UmaxB : constant Long_Long_Unsigned := Long_Long_Unsigned'Last / Base; -- Numbers bigger than UmaxB overflow if multiplied by base begin for J in 1 .. Expon loop if Uval > UmaxB then Overflow := True; exit; end if; Uval := Uval * Base; end loop; end; end if; -- Return result, dealing with sign and overflow if Overflow then Bad_Value (Str); else return Uval; end if; end Scan_Raw_Long_Long_Unsigned; ----------------------------- -- Scan_Long_Long_Unsigned -- ----------------------------- function Scan_Long_Long_Unsigned (Str : String; Ptr : not null access Integer; Max : Integer) return Long_Long_Unsigned is Start : Positive; -- Save location of first non-blank character begin Scan_Plus_Sign (Str, Ptr, Max, Start); if Str (Ptr.all) not in '0' .. '9' then Ptr.all := Start; raise Constraint_Error; end if; return Scan_Raw_Long_Long_Unsigned (Str, Ptr, Max); end Scan_Long_Long_Unsigned; ------------------------------ -- Value_Long_Long_Unsigned -- ------------------------------ function Value_Long_Long_Unsigned (Str : String) return Long_Long_Unsigned is begin -- We have to special case Str'Last = Positive'Last because the normal -- circuit ends up setting P to Str'Last + 1 which is out of bounds. We -- deal with this by converting to a subtype which fixes the bounds. if Str'Last = Positive'Last then declare subtype NT is String (1 .. Str'Length); begin return Value_Long_Long_Unsigned (NT (Str)); end; -- Normal case where Str'Last < Positive'Last else declare V : Long_Long_Unsigned; P : aliased Integer := Str'First; begin V := Scan_Long_Long_Unsigned (Str, P'Access, Str'Last); Scan_Trailing_Blanks (Str, P); return V; end; end if; end Value_Long_Long_Unsigned; end System.Val_LLU;

34.151057

78

0.47753

04caef7183f653ec6989646e0035337977fc0d8f

3,619

ads

Ada

source/strings/a-snmgca.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/strings/a-snmgca.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/strings/a-snmgca.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); -- implementation unit package Ada.Strings.Naked_Maps.General_Category is pragma Preelaborate; -- General_Category=Unassigned (Cn) function Unassigned return not null Character_Set_Access; function All_Unassigned return not null Character_Set_Access; -- Contains Unassigned + [16#110000# .. Wide_Wide_Character'Last]. -- General_Category=Uppercase_Letter (Lu) function Uppercase_Letter return not null Character_Set_Access; -- General_Category=Lowercase_Letter (Ll) function Lowercase_Letter return not null Character_Set_Access; -- General_Category=Titlecase_Letter (Lt) function Titlecase_Letter return not null Character_Set_Access; -- General_Category=Modifier_Letter (Lm) function Modifier_Letter return not null Character_Set_Access; -- General_Category=Other_Letter (Lo) function Other_Letter return not null Character_Set_Access; -- General_Category=Nonspacing_Mark (Mn) function Nonspacing_Mark return not null Character_Set_Access; -- General_Category=Enclosing_Mark (Me) function Enclosing_Mark return not null Character_Set_Access; -- General_Category=Spacing_Mark (Mc) function Spacing_Mark return not null Character_Set_Access; -- General_Category=Decimal_Number (Nd) function Decimal_Number return not null Character_Set_Access; -- General_Category=Letter_Number (Nl) function Letter_Number return not null Character_Set_Access; -- General_Category=Other_Number (No) function Other_Number return not null Character_Set_Access; -- General_Category=Space_Separator (Zs) function Space_Separator return not null Character_Set_Access; -- General_Category=Line_Separator (Zl) function Line_Separator return not null Character_Set_Access; -- General_Category=Paragraph_Separator (Zp) function Paragraph_Separator return not null Character_Set_Access; -- General_Category=Control (Cc) function Control return not null Character_Set_Access; -- General_Category=Format (Cf) function Format return not null Character_Set_Access; -- General_Category=Private_Use (Co) function Private_Use return not null Character_Set_Access; -- General_Category=Surrogate (Cs) function Surrogate return not null Character_Set_Access; -- General_Category=Dash_Punctuation (Pd) function Dash_Punctuation return not null Character_Set_Access; -- General_Category=Open_Punctuation (Ps) function Open_Punctuation return not null Character_Set_Access; -- General_Category=Close_Punctuation (Pe) function Close_Punctuation return not null Character_Set_Access; -- General_Category=Connector_Punctuation (Pc) function Connector_Punctuation return not null Character_Set_Access; -- General_Category=Other_Punctuation (Po) function Other_Punctuation return not null Character_Set_Access; -- General_Category=Math_Symbol (Sm) function Math_Symbol return not null Character_Set_Access; -- General_Category=Currency_Symbol (Sc) function Currency_Symbol return not null Character_Set_Access; -- General_Category=Modifier_Symbol (Sk) function Modifier_Symbol return not null Character_Set_Access; -- General_Category=Other_Symbol (So) function Other_Symbol return not null Character_Set_Access; -- General_Category=Initial_Punctuation (Pi) function Initial_Punctuation return not null Character_Set_Access; -- General_Category=Final_Punctuation (Pf) function Final_Punctuation return not null Character_Set_Access; end Ada.Strings.Naked_Maps.General_Category;

36.555556

73

0.791103

adc5b6cfa53dd6bb25ef3a2f28ea1d9206db8b22

796

ada

Ada

Task/Permutations/Ada/permutations-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Permutations/Ada/permutations-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Permutations/Ada/permutations-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

with Ada.Text_IO, Ada.Command_Line, Generic_Perm; procedure Print_Perms is package CML renames Ada.Command_Line; package TIO renames Ada.Text_IO; begin declare package Perms is new Generic_Perm(Positive'Value(CML.Argument(1))); P : Perms.Permutation; Done : Boolean := False; procedure Print(P: Perms.Permutation) is begin for I in P'Range loop TIO.Put (Perms.Element'Image (P (I))); end loop; TIO.New_Line; end Print; begin Perms.Set_To_First(P, Done); loop Print(P); exit when Done; Perms.Go_To_Next(P, Done); end loop; end; exception when Constraint_Error => TIO.Put_Line ("*** Error: enter one numerical argument n with n >= 1"); end Print_Perms;

25.677419

79

0.623116

a03c7811b504b5e350dc28964f848e435d5ef47f

98

ads

Ada

examples/src/examples-navigation.ads

TNO/Rejuvenation-Ada

8113ec28da3923ccde40d76cbab70e0e614f4b75

[ "BSD-3-Clause" ]

1

2022-03-08T13:00:47.000Z

src/examples/Rejuvenation_Examples/src/examples-navigation.ads

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

src/examples/Rejuvenation_Examples/src/examples-navigation.ads

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

package Examples.Navigation is procedure Demo (File_Name : String); end Examples.Navigation;

16.333333

39

0.77551

8b540fffc9f0f249e7c697cbcdc06e4740118726

1,070

adb

Ada

regtests/security_harness.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

19

2015-01-18T23:04:59.000Z

2021-11-30T10:39:10.000Z

regtests/security_harness.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

4

2020-08-06T15:37:51.000Z

2022-02-04T20:19:39.000Z

regtests/security_harness.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

3

2021-01-04T10:23:22.000Z

2022-01-30T21:45:49.000Z

----------------------------------------------------------------------- -- Security -- Unit tests for the Ada Security -- Copyright (C) 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Tests; with Security.Testsuite; procedure Security_Harness is procedure Harness is new Util.Tests.Harness (Security.Testsuite.Suite); begin Harness ("security-tests.xml"); end Security_Harness;

38.214286

76

0.64486

13ba5598aa0cb8c012b41427837b24b8a62c8eeb

3,584

ads

Ada

ada/src/avtas/lmcp/avtas-lmcp-bytebuffers.ads

joffreyhuguet/LmcpGen

3a75248e536f1147d9208ec021cc5105206c3477

[ "NASA-1.3" ]

null

ada/src/avtas/lmcp/avtas-lmcp-bytebuffers.ads

joffreyhuguet/LmcpGen

3a75248e536f1147d9208ec021cc5105206c3477

[ "NASA-1.3" ]

null

ada/src/avtas/lmcp/avtas-lmcp-bytebuffers.ads

joffreyhuguet/LmcpGen

3a75248e536f1147d9208ec021cc5105206c3477

[ "NASA-1.3" ]

null

with avtas.lmcp.types; use avtas.lmcp.types; with Ada.Text_IO; use Ada.Text_IO; with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; with Ada.Unchecked_Conversion; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; package avtas.lmcp.byteBuffers is type Nat is range 1 .. UInt32_t'Last; type ByteArray is array (Nat range <>) of Byte; type ByteArray2 is array (1 .. 2) of Byte; type ByteArray4 is array (1 .. 4) of Byte; type ByteArray8 is array (1 .. 8) of Byte; type Int16Array is array (Nat range <>) of Int16_t; type Int32Array is array (Nat range <>) of Int32_t; type Int64Array is array (Nat range <>) of Int64_t; type UInt16Array is array (Nat range <>) of UInt16_t; type UInt32Array is array (Nat range <>) of UInt32_t; type FloatArray is array (Nat range <>) of Float_t; type DoubleArray is array (Nat range <>) of Double_t; type StringArray is array (Nat range <>) of Unbounded_String; type BooleanArray is array (Nat range <>) of Boolean; type ByteBuffer(Capacity : Nat) is record Pos : Nat := 1; Buf : ByteArray(1 .. Capacity); end record; function To_Boolean(Source : Byte) return Boolean is (if Source = 0 then False else True); function To_String(Input : ByteArray) return Unbounded_String; function To_Int16(Input : ByteArray2) return Int16_t; function To_Int32(Input : ByteArray4) return Int32_t; function To_Int64(Input : ByteArray8) return Int64_t; function To_UInt16(Input : ByteArray2) return UInt16_t; function To_UInt32(Input : ByteArray4) return UInt32_t; function To_Float(Input : ByteArray4) return Float_t; function To_Double(Input : ByteArray8) return Double_t; -- function To_Int16 is -- new Ada.Unchecked_Conversion (Source => ByteArray2, Target => Int16_t); -- function To_Int32 is -- new Ada.Unchecked_Conversion (Source => ByteArray4, Target => Int32_t); -- function To_Int64 is -- new Ada.Unchecked_Conversion (Source => ByteArray8, Target => Int64_t); -- function To_UInt16 is -- new Ada.Unchecked_Conversion (Source => ByteArray2, Target => UInt16_t); -- function To_UInt32 is -- new Ada.Unchecked_Conversion (Source => ByteArray4, Target => UInt32_t); -- function To_Float is -- new Ada.Unchecked_Conversion (Source => ByteArray4, Target => Float_t); -- function To_Double is -- new Ada.Unchecked_Conversion (Source => ByteArray8, Target => Double_t); function To_BooleanArray(Input : ByteArray) return BooleanArray; function To_StringArray(Input : ByteArray) return StringArray; function To_Int16Array(Input : ByteArray) return Int16Array; function To_Int32Array(Input : ByteArray) return Int32Array; function To_Int64Array(Input : ByteArray) return Int64Array; function To_UInt16Array(Input : ByteArray) return UInt16Array; function To_UInt32Array(Input : ByteArray) return UInt32Array; function To_FloatArray(Input : ByteArray) return FloatArray; function To_DoubleArray(Input : ByteArray) return DoubleArray; function capacity(this : ByteBuffer) return Nat is (this.Capacity); function getPosition(this : ByteBuffer) return Nat is (this.Pos); function remaining(this : ByteBuffer) return UInt32_t is (UInt32_t(this.Capacity - this.Pos)); function hasRemaining(this : ByteBuffer) return Boolean is (this.Pos < this.Capacity); --procedure setPosition(this : in out ByteBuffer; position : in Nat); --procedure incrementPosition(this : in out ByteBuffer; amount : in Int32_t); end avtas.lmcp.byteBuffers;

48.432432

97

0.722377

38ee430056ee2a2829e99bd6afb25e83f7169fd4

873

adb

Ada

courses/fundamentals_of_ada/labs/radar/030_basic_types/util/radar_internals.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

15

2020-10-07T08:56:45.000Z

2022-02-08T23:13:22.000Z

courses/fundamentals_of_ada/labs/radar/030_basic_types/util/radar_internals.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

20

2020-11-05T14:35:20.000Z

2022-01-13T15:59:33.000Z

courses/fundamentals_of_ada/labs/radar/030_basic_types/util/radar_internals.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

6

2020-10-08T15:57:06.000Z

2021-08-31T12:03:08.000Z

with Ada.Text_IO; use Ada.Text_IO; package body Radar_Internals is T : Natural := 0; procedure Time_Step (Radar_Angle : Float; Time_To_Arrival : Float; John_Connor_Status : String) is E_T_A_H : Integer := Integer (Float'Floor (Time_To_Arrival / 3600.0)); E_T_A_M : Integer := Integer (Float'Floor (Time_To_Arrival / 60.0)) mod 60; E_T_A_S : Integer := Integer (Float'Rounding (Time_To_Arrival)) mod 60; begin Put_Line ("T =" & Natural'Image(T) & " " & "ETA" & Integer'Image (E_T_A_H) & "h" & Integer'Image (E_T_A_M) & "m" & Integer'Image (E_T_A_S) & "s" & " " & "John Connor is " & John_Connor_Status); T := T + 1; end Time_Step; end Radar_Internals;

29.1

76

0.522337

8b0a33913b8f57c1b3ab885a18bb29d5a5dffd87

16,207

ads

Ada

tools/scitools/conf/understand/ada/ada12/a-comutr.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/a-comutr.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/a-comutr.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . C O N T A I N E R S . M U L T I W A Y _ T R E E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2012, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Iterator_Interfaces; private with Ada.Finalization; private with Ada.Streams; generic type Element_Type is private; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Multiway_Trees is pragma Preelaborate; pragma Remote_Types; type Tree is tagged private with Constant_Indexing => Constant_Reference, Variable_Indexing => Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; pragma Preelaborable_Initialization (Tree); type Cursor is private; pragma Preelaborable_Initialization (Cursor); Empty_Tree : constant Tree; No_Element : constant Cursor; function Has_Element (Position : Cursor) return Boolean; package Tree_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function Equal_Subtree (Left_Position : Cursor; Right_Position : Cursor) return Boolean; function "=" (Left, Right : Tree) return Boolean; function Is_Empty (Container : Tree) return Boolean; function Node_Count (Container : Tree) return Count_Type; function Subtree_Node_Count (Position : Cursor) return Count_Type; function Depth (Position : Cursor) return Count_Type; function Is_Root (Position : Cursor) return Boolean; function Is_Leaf (Position : Cursor) return Boolean; function Root (Container : Tree) return Cursor; procedure Clear (Container : in out Tree); function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out Tree; Position : Cursor; New_Item : Element_Type); procedure Query_Element (Position : Cursor; Process : not null access procedure (Element : Element_Type)); procedure Update_Element (Container : in out Tree; Position : Cursor; Process : not null access procedure (Element : in out Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased Tree; Position : Cursor) return Constant_Reference_Type; pragma Inline (Constant_Reference); function Reference (Container : aliased in out Tree; Position : Cursor) return Reference_Type; pragma Inline (Reference); procedure Assign (Target : in out Tree; Source : Tree); function Copy (Source : Tree) return Tree; procedure Move (Target : in out Tree; Source : in out Tree); procedure Delete_Leaf (Container : in out Tree; Position : in out Cursor); procedure Delete_Subtree (Container : in out Tree; Position : in out Cursor); procedure Swap (Container : in out Tree; I, J : Cursor); function Find (Container : Tree; Item : Element_Type) return Cursor; -- This version of the AI: -- 10-06-02 AI05-0136-1/07 -- declares Find_In_Subtree this way: -- -- function Find_In_Subtree -- (Container : Tree; -- Item : Element_Type; -- Position : Cursor) return Cursor; -- -- It seems that the Container parameter is there by mistake, but we need -- an official ruling from the ARG. ??? function Find_In_Subtree (Position : Cursor; Item : Element_Type) return Cursor; -- This version of the AI: -- 10-06-02 AI05-0136-1/07 -- declares Ancestor_Find this way: -- -- function Ancestor_Find -- (Container : Tree; -- Item : Element_Type; -- Position : Cursor) return Cursor; -- -- It seems that the Container parameter is there by mistake, but we need -- an official ruling from the ARG. ??? function Ancestor_Find (Position : Cursor; Item : Element_Type) return Cursor; function Contains (Container : Tree; Item : Element_Type) return Boolean; procedure Iterate (Container : Tree; Process : not null access procedure (Position : Cursor)); procedure Iterate_Subtree (Position : Cursor; Process : not null access procedure (Position : Cursor)); function Iterate (Container : Tree) return Tree_Iterator_Interfaces.Forward_Iterator'Class; function Iterate_Subtree (Position : Cursor) return Tree_Iterator_Interfaces.Forward_Iterator'Class; function Iterate_Children (Container : Tree; Parent : Cursor) return Tree_Iterator_Interfaces.Reversible_Iterator'Class; function Child_Count (Parent : Cursor) return Count_Type; function Child_Depth (Parent, Child : Cursor) return Count_Type; procedure Insert_Child (Container : in out Tree; Parent : Cursor; Before : Cursor; New_Item : Element_Type; Count : Count_Type := 1); procedure Insert_Child (Container : in out Tree; Parent : Cursor; Before : Cursor; New_Item : Element_Type; Position : out Cursor; Count : Count_Type := 1); procedure Insert_Child (Container : in out Tree; Parent : Cursor; Before : Cursor; Position : out Cursor; Count : Count_Type := 1); procedure Prepend_Child (Container : in out Tree; Parent : Cursor; New_Item : Element_Type; Count : Count_Type := 1); procedure Append_Child (Container : in out Tree; Parent : Cursor; New_Item : Element_Type; Count : Count_Type := 1); procedure Delete_Children (Container : in out Tree; Parent : Cursor); procedure Copy_Subtree (Target : in out Tree; Parent : Cursor; Before : Cursor; Source : Cursor); procedure Splice_Subtree (Target : in out Tree; Parent : Cursor; Before : Cursor; Source : in out Tree; Position : in out Cursor); procedure Splice_Subtree (Container : in out Tree; Parent : Cursor; Before : Cursor; Position : Cursor); procedure Splice_Children (Target : in out Tree; Target_Parent : Cursor; Before : Cursor; Source : in out Tree; Source_Parent : Cursor); procedure Splice_Children (Container : in out Tree; Target_Parent : Cursor; Before : Cursor; Source_Parent : Cursor); function Parent (Position : Cursor) return Cursor; function First_Child (Parent : Cursor) return Cursor; function First_Child_Element (Parent : Cursor) return Element_Type; function Last_Child (Parent : Cursor) return Cursor; function Last_Child_Element (Parent : Cursor) return Element_Type; function Next_Sibling (Position : Cursor) return Cursor; function Previous_Sibling (Position : Cursor) return Cursor; procedure Next_Sibling (Position : in out Cursor); procedure Previous_Sibling (Position : in out Cursor); -- This version of the AI: -- 10-06-02 AI05-0136-1/07 -- declares Iterate_Children this way: -- -- procedure Iterate_Children -- (Container : Tree; -- Parent : Cursor; -- Process : not null access procedure (Position : Cursor)); -- -- It seems that the Container parameter is there by mistake, but we need -- an official ruling from the ARG. ??? procedure Iterate_Children (Parent : Cursor; Process : not null access procedure (Position : Cursor)); procedure Reverse_Iterate_Children (Parent : Cursor; Process : not null access procedure (Position : Cursor)); private -- A node of this multiway tree comprises an element and a list of children -- (that are themselves trees). The root node is distinguished because it -- contains only children: it does not have an element itself. -- -- This design feature puts two design goals in tension: -- (1) treat the root node the same as any other node -- (2) not declare any objects of type Element_Type unnecessarily -- -- To satisfy (1), we could simply declare the Root node of the tree using -- the normal Tree_Node_Type, but that would mean that (2) is not -- satisfied. To resolve the tension (in favor of (2)), we declare the -- component Root as having a different node type, without an Element -- component (thus satisfying goal (2)) but otherwise identical to a normal -- node, and then use Unchecked_Conversion to convert an access object -- designating the Root node component to the access type designating a -- normal, non-root node (thus satisfying goal (1)). We make an explicit -- check for Root when there is any attempt to manipulate the Element -- component of the node (a check required by the RM anyway). -- -- In order to be explicit about node (and pointer) representation, we -- specify that the respective node types have convention C, to ensure that -- the layout of the components of the node records is the same, thus -- guaranteeing that (unchecked) conversions between access types -- designating each kind of node type is a meaningful conversion. type Tree_Node_Type; type Tree_Node_Access is access all Tree_Node_Type; pragma Convention (C, Tree_Node_Access); type Children_Type is record First : Tree_Node_Access; Last : Tree_Node_Access; end record; -- See the comment above. This declaration must exactly match the -- declaration of Root_Node_Type (except for the Element component). type Tree_Node_Type is record Parent : Tree_Node_Access; Prev : Tree_Node_Access; Next : Tree_Node_Access; Children : Children_Type; Element : aliased Element_Type; end record; pragma Convention (C, Tree_Node_Type); -- See the comment above. This declaration must match the declaration of -- Tree_Node_Type (except for the Element component). type Root_Node_Type is record Parent : Tree_Node_Access; Prev : Tree_Node_Access; Next : Tree_Node_Access; Children : Children_Type; end record; pragma Convention (C, Root_Node_Type); use Ada.Finalization; -- The Count component of type Tree represents the number of nodes that -- have been (dynamically) allocated. It does not include the root node -- itself. As implementors, we decide to cache this value, so that the -- selector function Node_Count can execute in O(1) time, in order to be -- consistent with the behavior of the Length selector function for other -- standard container library units. This does mean, however, that the -- two-container forms for Splice_XXX (that move subtrees across tree -- containers) will execute in O(n) time, because we must count the number -- of nodes in the subtree(s) that get moved. (We resolve the tension -- between Node_Count and Splice_XXX in favor of Node_Count, under the -- assumption that Node_Count is the more common operation). type Tree is new Controlled with record Root : aliased Root_Node_Type; Busy : Natural := 0; Lock : Natural := 0; Count : Count_Type := 0; end record; overriding procedure Adjust (Container : in out Tree); overriding procedure Finalize (Container : in out Tree) renames Clear; use Ada.Streams; procedure Write (Stream : not null access Root_Stream_Type'Class; Container : Tree); for Tree'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Container : out Tree); for Tree'Read use Read; type Tree_Access is access all Tree; for Tree_Access'Storage_Size use 0; type Cursor is record Container : Tree_Access; Node : Tree_Node_Access; end record; procedure Write (Stream : not null access Root_Stream_Type'Class; Position : Cursor); for Cursor'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Position : out Cursor); for Cursor'Read use Read; type Reference_Control_Type is new Controlled with record Container : Tree_Access; end record; overriding procedure Adjust (Control : in out Reference_Control_Type); pragma Inline (Adjust); overriding procedure Finalize (Control : in out Reference_Control_Type); pragma Inline (Finalize); type Constant_Reference_Type (Element : not null access constant Element_Type) is record Control : Reference_Control_Type; end record; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Constant_Reference_Type); for Constant_Reference_Type'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Constant_Reference_Type); for Constant_Reference_Type'Write use Write; type Reference_Type (Element : not null access Element_Type) is record Control : Reference_Control_Type; end record; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Reference_Type); for Reference_Type'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Reference_Type); for Reference_Type'Write use Write; Empty_Tree : constant Tree := (Controlled with others => <>); No_Element : constant Cursor := (others => <>); end Ada.Containers.Multiway_Trees;

33.764583

79

0.619856

3801a17e136747d57ffe3db9da6f9a63d86290b9

5,238

adb

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-wwdwch.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-wwdwch.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-wwdwch.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W W D _ W C H A R -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Interfaces; use Interfaces; with System.WWd_Char; package body System.Wwd_WChar is ------------------------------------ -- Wide_Wide_Width_Wide_Character -- ------------------------------------ -- This is the case where we are talking about the Wide_Wide_Image of -- a Wide_Character, which is always the same character sequence as the -- Wide_Image of the same Wide_Character. function Wide_Wide_Width_Wide_Character (Lo, Hi : Wide_Character) return Natural is begin return Wide_Width_Wide_Character (Lo, Hi); end Wide_Wide_Width_Wide_Character; ------------------------------------ -- Wide_Wide_Width_Wide_Wide_Char -- ------------------------------------ function Wide_Wide_Width_Wide_Wide_Char (Lo, Hi : Wide_Wide_Character) return Natural is LV : constant Unsigned_32 := Wide_Wide_Character'Pos (Lo); HV : constant Unsigned_32 := Wide_Wide_Character'Pos (Hi); begin -- Return zero if empty range if LV > HV then return 0; -- Return max value (12) for wide character (Hex_hhhhhhhh) elsif HV > 255 then return 12; -- If any characters in normal character range, then use normal -- Wide_Wide_Width attribute on this range to find out a starting point. -- Otherwise start with zero. else return System.WWd_Char.Wide_Wide_Width_Character (Lo => Character'Val (LV), Hi => Character'Val (Unsigned_32'Min (255, HV))); end if; end Wide_Wide_Width_Wide_Wide_Char; ------------------------------- -- Wide_Width_Wide_Character -- ------------------------------- function Wide_Width_Wide_Character (Lo, Hi : Wide_Character) return Natural is LV : constant Unsigned_32 := Wide_Character'Pos (Lo); HV : constant Unsigned_32 := Wide_Character'Pos (Hi); begin -- Return zero if empty range if LV > HV then return 0; -- Return max value (12) for wide character (Hex_hhhhhhhh) elsif HV > 255 then return 12; -- If any characters in normal character range, then use normal -- Wide_Wide_Width attribute on this range to find out a starting point. -- Otherwise start with zero. else return System.WWd_Char.Wide_Width_Character (Lo => Character'Val (LV), Hi => Character'Val (Unsigned_32'Min (255, HV))); end if; end Wide_Width_Wide_Character; ------------------------------------ -- Wide_Width_Wide_Wide_Character -- ------------------------------------ function Wide_Width_Wide_Wide_Character (Lo, Hi : Wide_Wide_Character) return Natural is begin return Wide_Wide_Width_Wide_Wide_Char (Lo, Hi); end Wide_Width_Wide_Wide_Character; end System.Wwd_WChar;

39.984733

79

0.458763

8b1e847c9a91d75bf744bf049032c64de1445e2c

5,801

adb

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-hesora.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-hesora.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-hesora.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . H E A P _ S O R T _ A -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-2021, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; package body GNAT.Heap_Sort_A is ---------- -- Sort -- ---------- -- We are using the classical heapsort algorithm (i.e. Floyd's Treesort3) -- as described by Knuth ("The Art of Programming", Volume III, first -- edition, section 5.2.3, p. 145-147) with the modification that is -- mentioned in exercise 18. For more details on this algorithm, see -- Robert B. K. Dewar PhD thesis "The use of Computers in the X-ray -- Phase Problem". University of Chicago, 1968, which was the first -- publication of the modification, which reduces the number of compares -- from 2NlogN to NlogN. procedure Sort (N : Natural; Move : Move_Procedure; Lt : Lt_Function) is Max : Natural := N; -- Current Max index in tree being sifted procedure Sift (S : Positive); -- This procedure sifts up node S, i.e. converts the subtree rooted -- at node S into a heap, given the precondition that any sons of -- S are already heaps. On entry, the contents of node S is found -- in the temporary (index 0), the actual contents of node S on -- entry are irrelevant. This is just a minor optimization to avoid -- what would otherwise be two junk moves in phase two of the sort. procedure Sift (S : Positive) is C : Positive := S; Son : Positive; Father : Positive; begin -- This is where the optimization is done, normally we would do a -- comparison at each stage between the current node and the larger -- of the two sons, and continue the sift only if the current node -- was less than this maximum. In this modified optimized version, -- we assume that the current node will be less than the larger -- son, and unconditionally sift up. Then when we get to the bottom -- of the tree, we check parents to make sure that we did not make -- a mistake. This roughly cuts the number of comparisons in half, -- since it is almost always the case that our assumption is correct. -- Loop to pull up larger sons loop Son := 2 * C; exit when Son > Max; if Son < Max and then Lt (Son, Son + 1) then Son := Son + 1; end if; Move (Son, C); C := Son; end loop; -- Loop to check fathers while C /= S loop Father := C / 2; if Lt (Father, 0) then Move (Father, C); C := Father; else exit; end if; end loop; -- Last step is to pop the sifted node into place Move (0, C); end Sift; -- Start of processing for Sort begin -- Phase one of heapsort is to build the heap. This is done by -- sifting nodes N/2 .. 1 in sequence. for J in reverse 1 .. N / 2 loop Move (J, 0); Sift (J); end loop; -- In phase 2, the largest node is moved to end, reducing the size -- of the tree by one, and the displaced node is sifted down from -- the top, so that the largest node is again at the top. while Max > 1 loop Move (Max, 0); Move (1, Max); Max := Max - 1; Sift (1); end loop; end Sort; end GNAT.Heap_Sort_A;

42.97037

79

0.458542

8b94b27c5e702d4ddf39bfdc97775720b9ca62dd

4,030

ads

Ada

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstdebugutils_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

1

2018-01-18T00:51:00.000Z

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstdebugutils_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

null

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstdebugutils_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

null

pragma Ada_2005; pragma Style_Checks (Off); pragma Warnings (Off); with Interfaces.C; use Interfaces.C; package GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstdebugutils_h is -- arg-macro: procedure GST_DEBUG_BIN_TO_DOT_FILE (bin, details, file_name) -- _gst_debug_bin_to_dot_file (bin, details, file_name) -- arg-macro: procedure GST_DEBUG_BIN_TO_DOT_FILE_WITH_TS (bin, details, file_name) -- _gst_debug_bin_to_dot_file_with_ts (bin, details, file_name) -- GStreamer -- * Copyright (C) 2007 Stefan Kost <[email protected]> -- * -- * gstdebugutils.h: debugging and analysis utillities -- * -- * This library is free software; you can redistribute it and/or -- * modify it under the terms of the GNU Library General Public -- * License as published by the Free Software Foundation; either -- * version 2 of the License, or (at your option) any later version. -- * -- * This library 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 GNU -- * Library General Public License for more details. -- * -- * You should have received a copy of the GNU Library General Public -- * License along with this library; if not, write to the -- * Free Software Foundation, Inc., 59 Temple Place - Suite 330, -- * Boston, MA 02111-1307, USA. -- --* -- * GstDebugGraphDetails: -- * @GST_DEBUG_GRAPH_SHOW_MEDIA_TYPE: show caps-name on edges -- * @GST_DEBUG_GRAPH_SHOW_CAPS_DETAILS: show caps-details on edges -- * @GST_DEBUG_GRAPH_SHOW_NON_DEFAULT_PARAMS: show modified parameters on elements -- * @GST_DEBUG_GRAPH_SHOW_STATES: show element states -- * @GST_DEBUG_GRAPH_SHOW_ALL: show all details -- * -- * Available details for pipeline graphs produced by GST_DEBUG_BIN_TO_DOT_FILE() -- * and GST_DEBUG_BIN_TO_DOT_FILE_WITH_TS(). -- * -- * Since: 0.10.15 -- subtype GstDebugGraphDetails is unsigned; GST_DEBUG_GRAPH_SHOW_MEDIA_TYPE : constant GstDebugGraphDetails := 1; GST_DEBUG_GRAPH_SHOW_CAPS_DETAILS : constant GstDebugGraphDetails := 2; GST_DEBUG_GRAPH_SHOW_NON_DEFAULT_PARAMS : constant GstDebugGraphDetails := 4; GST_DEBUG_GRAPH_SHOW_STATES : constant GstDebugGraphDetails := 8; GST_DEBUG_GRAPH_SHOW_ALL : constant GstDebugGraphDetails := 15; -- gst/gstdebugutils.h:51 --********* pipeline graphs ********* -- skipped func _gst_debug_bin_to_dot_file -- skipped func _gst_debug_bin_to_dot_file_with_ts --* -- * GST_DEBUG_BIN_TO_DOT_FILE: -- * @bin: the top-level pipeline that should be analyzed -- * @details: details to show in the graph, e.g. #GST_DEBUG_GRAPH_SHOW_ALL or -- * one or more other #GstDebugGraphDetails flags. -- * @file_name: output base filename (e.g. "myplayer") -- * -- * To aid debugging applications one can use this method to write out the whole -- * network of gstreamer elements that form the pipeline into an dot file. -- * This file can be processed with graphviz to get an image. -- * <informalexample><programlisting> -- * dot -Tpng -oimage.png graph_lowlevel.dot -- * </programlisting></informalexample> -- * -- * The macro is only active if gstreamer is configured with -- * "--gst-enable-gst-debug" and the environment variable -- * GST_DEBUG_DUMP_DOT_DIR is set to a basepath (e.g. /tmp). -- * -- * Since: 0.10.15 -- --* -- * GST_DEBUG_BIN_TO_DOT_FILE_WITH_TS: -- * @bin: the top-level pipeline that should be analyzed -- * @details: details to show in the graph, e.g. #GST_DEBUG_GRAPH_SHOW_ALL or -- * one or more other #GstDebugGraphDetails flags. -- * @file_name: output base filename (e.g. "myplayer") -- * -- * This works like GST_DEBUG_BIN_TO_DOT_FILE(), but adds the current timestamp -- * to the filename, so that it can be used to take multiple snapshots. -- * -- * Since: 0.10.15 -- end GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstdebugutils_h;

42.421053

93

0.7134

a0d58af8506002e68c15b720f2a64e41e9797abf

1,741

ads

Ada

awa/src/awa-users.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/src/awa-users.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/src/awa-users.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- awa-users -- Users module -- Copyright (C) 2009, 2010, 2011, 2015, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- = Users Module = -- The `Users.Module` manages the creation, update, removal and authentication of users -- in an application. The module provides the foundations for user management in -- a web application. -- -- A user can register himself by using a subscription form. In that case, a verification mail -- is sent and the user has to follow the verification link defined in the mail to finish -- the registration process. The user will authenticate using a password. -- -- A user can also use an OpenID account and be automatically registered. -- -- A user can have one or several permissions that allow to protect the application data. -- User permissions are managed by the `Permissions.Module`. -- -- @include awa-users-modules.ads -- -- == Data model == -- [images/awa_users_model.png] -- package AWA.Users is pragma Preelaborate; end AWA.Users;

40.488372

96

0.670304

1ec000cd3c3bb754efc6a18607d21d60e9fd6381

7,284

adb

Ada

awa/plugins/awa-wikis/src/awa-wikis-previews.adb

stcarrez/ada-awa

0b153316e3f0462789c5cb255dd60624d73d06f0

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-wikis/src/awa-wikis-previews.adb

jquorning/ada-awa

1307bbadbbaba34052b3bf1b1707e07c58c98e4c

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-wikis/src/awa-wikis-previews.adb

jquorning/ada-awa

1307bbadbbaba34052b3bf1b1707e07c58c98e4c

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-wikis-previews -- Wiki preview management -- Copyright (C) 2015, 2018, 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Strings.Unbounded; with Util.Log.Loggers; with Util.Beans.Objects; with Util.Files; with Util.Processes; with Util.Streams.Pipes; with Util.Streams.Texts; with EL.Contexts.TLS; with Servlet.Core; with ASF.Requests.Mockup; with ASF.Responses.Mockup; with AWA.Applications; with AWA.Modules.Get; package body AWA.Wikis.Previews is Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Wikis.Preview"); -- ------------------------------ -- The worker procedure that performs the preview job. -- ------------------------------ procedure Preview_Worker (Job : in out AWA.Jobs.Services.Abstract_Job_Type'Class) is Previewer : constant Preview_Module_Access := Get_Preview_Module; begin Previewer.Do_Preview_Job (Job); end Preview_Worker; -- ------------------------------ -- Initialize the wikis module. -- ------------------------------ overriding procedure Initialize (Plugin : in out Preview_Module; App : in AWA.Modules.Application_Access; Props : in ASF.Applications.Config) is begin Log.Info ("Initializing the wiki preview module"); AWA.Modules.Module (Plugin).Initialize (App, Props); end Initialize; -- ------------------------------ -- Configures the module after its initialization and after having read its XML configuration. -- ------------------------------ overriding procedure Configure (Plugin : in out Preview_Module; Props : in ASF.Applications.Config) is pragma Unreferenced (Props); begin Plugin.Template := Plugin.Get_Config (PARAM_PREVIEW_TEMPLATE); Plugin.Command := Plugin.Get_Config (PARAM_PREVIEW_COMMAND); Plugin.Html := Plugin.Get_Config (PARAM_PREVIEW_HTML); Plugin.Add_Listener (AWA.Wikis.Modules.NAME, Plugin'Unchecked_Access); Plugin.Job_Module := AWA.Jobs.Modules.Get_Job_Module; Plugin.Job_Module.Register (Definition => Preview_Job_Definition.Factory); end Configure; -- ------------------------------ -- Execute the preview job and make the thumbnail preview. The page is first rendered in -- an HTML text file and the preview is rendered by using an external command. -- ------------------------------ procedure Do_Preview_Job (Plugin : in Preview_Module; Job : in out AWA.Jobs.Services.Abstract_Job_Type'Class) is pragma Unreferenced (Job); use Util.Beans.Objects; Ctx : constant EL.Contexts.ELContext_Access := EL.Contexts.TLS.Current; Template : constant String := To_String (Plugin.Template.Get_Value (Ctx.all)); Command : constant String := To_String (Plugin.Command.Get_Value (Ctx.all)); Html_File : constant String := To_String (Plugin.Html.Get_Value (Ctx.all)); begin Log.Info ("Preview {0} with {1}", Template, Command); declare Req : ASF.Requests.Mockup.Request; Reply : ASF.Responses.Mockup.Response; Dispatcher : constant Servlet.Core.Request_Dispatcher := Plugin.Get_Application.Get_Request_Dispatcher (Template); Result : Ada.Strings.Unbounded.Unbounded_String; begin Req.Set_Request_URI (Template); Req.Set_Method ("GET"); Servlet.Core.Forward (Dispatcher, Req, Reply); Reply.Read_Content (Result); Util.Files.Write_File (Html_File, Result); end; declare Pipe : aliased Util.Streams.Pipes.Pipe_Stream; Input : Util.Streams.Texts.Reader_Stream; begin Log.Info ("Running preview command {0}", Command); Pipe.Open (Command, Util.Processes.READ_ALL); Input.Initialize (Pipe'Unchecked_Access, 1024); while not Input.Is_Eof loop declare Line : Ada.Strings.Unbounded.Unbounded_String; begin Input.Read_Line (Line, False); Log.Info ("Received: {0}", Line); end; end loop; Pipe.Close; if Pipe.Get_Exit_Status /= 0 then Log.Error ("Command {0} exited with status {1}", Command, Integer'Image (Pipe.Get_Exit_Status)); end if; end; end Do_Preview_Job; -- ------------------------------ -- Create a preview job and schedule the job to generate a new thumbnail preview for the page. -- ------------------------------ procedure Make_Preview_Job (Plugin : in Preview_Module; Page : in AWA.Wikis.Models.Wiki_Page_Ref'Class) is pragma Unreferenced (Plugin); J : AWA.Jobs.Services.Job_Type; begin J.Set_Parameter ("wiki_space_id", Page.Get_Wiki); J.Set_Parameter ("wiki_page_id", Page); J.Schedule (Preview_Job_Definition.Factory.all); end Make_Preview_Job; -- ------------------------------ -- The `On_Create` procedure is called by `Notify_Create` to notify the creation of the page. -- ------------------------------ overriding procedure On_Create (Instance : in Preview_Module; Item : in AWA.Wikis.Models.Wiki_Page_Ref'Class) is begin Instance.Make_Preview_Job (Item); end On_Create; -- ------------------------------ -- The `On_Update` procedure is called by `Notify_Update` to notify the update of the page. -- ------------------------------ overriding procedure On_Update (Instance : in Preview_Module; Item : in AWA.Wikis.Models.Wiki_Page_Ref'Class) is begin Instance.Make_Preview_Job (Item); end On_Update; -- ------------------------------ -- The `On_Delete` procedure is called by `Notify_Delete` to notify the deletion of the page. -- ------------------------------ overriding procedure On_Delete (Instance : in Preview_Module; Item : in AWA.Wikis.Models.Wiki_Page_Ref'Class) is begin null; end On_Delete; -- ------------------------------ -- Get the preview module instance associated with the current application. -- ------------------------------ function Get_Preview_Module return Preview_Module_Access is function Get is new AWA.Modules.Get (Preview_Module, Preview_Module_Access, NAME); begin return Get; end Get_Preview_Module; end AWA.Wikis.Previews;

39.372973

98

0.59816

1e549ab1c75177ccdfdf77589772f86961b75c0e

3,626

ads

Ada

source/amf/uml/amf-uml-write_link_actions-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-write_link_actions-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-write_link_actions-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.UML.Write_Link_Actions.Hash is new AMF.Elements.Generic_Hash (UML_Write_Link_Action, UML_Write_Link_Action_Access);

72.52

86

0.404854

2ecb7e08a69ac87256bfd5041a543ef3d1582402

3,625

adb

Ada

samples/render.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

samples/render.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

samples/render.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- render -- XHTML Rendering example -- Copyright (C) 2010, 2017, 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Text_IO; with Ada.IO_Exceptions; with Ada.Strings.Unbounded; with Ada.Strings.Fixed; with GNAT.Command_Line; with ASF.Applications.Main; with ASF.Requests.Mockup; with ASF.Responses.Mockup; with ASF.Servlets; with ASF.Servlets.Faces; with ASF.Server; with EL.Objects; -- This example reads an XHTML file and renders the result. procedure Render is use GNAT.Command_Line; use Ada.Strings.Fixed; use ASF; use EL.Objects; Factory : ASF.Applications.Main.Application_Factory; Faces : aliased ASF.Servlets.Faces.Faces_Servlet; App : aliased Applications.Main.Application; Conf : Applications.Config; Container : ASF.Server.Container; begin Conf.Set ("view.ignore_white_spaces", "false"); Conf.Set ("view.escape_unknown_tags", "false"); Conf.Set ("view.ignore_empty_lines", "true"); Conf.Set ("view.dir", "./"); Conf.Set ("view.file_ext", ""); App.Initialize (Conf, Factory); App.Add_Servlet (Name => "file", Server => Faces'Unchecked_Access); App.Add_Mapping ("*.xhtml", "file"); Container.Register_Application ("/render", App'Unchecked_Access); loop case Getopt ("D:") is when 'D' => declare Value : constant String := Parameter; Pos : constant Natural := Index (Value, "="); begin if Pos > 0 then App.Set_Global (Name => Value (Value'First .. Pos - 1), Value => To_Object (Value (Pos + 1 .. Value'Last))); else App.Set_Global (Name => Value (Value'First .. Pos - 1), Value => To_Object (True)); end if; end; when others => exit; end case; end loop; declare View_Name : constant String := Get_Argument; Pos : constant Natural := Index (View_Name, "."); Req : ASF.Requests.Mockup.Request; Reply : ASF.Responses.Mockup.Response; Content : Ada.Strings.Unbounded.Unbounded_String; begin if View_Name = "" or Pos = 0 then Ada.Text_IO.Put_Line ("Usage: render [-DNAME=VALUE ] file"); Ada.Text_IO.Put_Line ("Example: render -DcontextPath=/test samples/web/ajax.xhtml"); return; end if; Req.Set_Method ("GET"); Req.Set_Request_URI ("/render/" & View_Name); -- View_Name (View_Name'First .. Pos - 1) & ".html"); App.Dispatch (View_Name, Req, Reply); Reply.Read_Content (Content); Ada.Text_IO.Put_Line (Ada.Strings.Unbounded.To_String (Content)); exception when Ada.IO_Exceptions.Name_Error => Ada.Text_IO.Put_Line ("Cannot read file '" & View_Name & "'"); end; end Render;

34.52381

106

0.60331

a08645a3bdbb2e31d18a7512df4341a9795e5ca0

302

ads

Ada

source/strings/a-stwifu.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/strings/a-stwifu.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/strings/a-stwifu.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); -- extended unit with Ada.Strings.Generic_Functions; package Ada.Strings.Wide_Functions is new Generic_Functions ( Character_Type => Wide_Character, String_Type => Wide_String, Space => Wide_Space); pragma Preelaborate (Ada.Strings.Wide_Functions);

30.2

49

0.754967

a09c2d36453a3ee5ab7c7b03291038b45a2499f4

3,681

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-pack44.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-pack44.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-pack44.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 4 4 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 44 package System.Pack_44 is pragma Preelaborate; Bits : constant := 44; type Bits_44 is mod 2 ** Bits; for Bits_44'Size use Bits; function Get_44 (Arr : System.Address; N : Natural) return Bits_44; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_44 (Arr : System.Address; N : Natural; E : Bits_44); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. function GetU_44 (Arr : System.Address; N : Natural) return Bits_44; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. This version -- is used when Arr may represent an unaligned address. procedure SetU_44 (Arr : System.Address; N : Natural; E : Bits_44); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. This version -- is used when Arr may represent an unaligned address end System.Pack_44;

58.428571

78

0.499593

1ad1f4897fee646631cd4be74ea113aac8974931

3,819

ads

Ada

source/contexts/plain/program-plain_contexts.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/contexts/plain/program-plain_contexts.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/contexts/plain/program-plain_contexts.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

2

2019-09-14T23:18:50.000Z

2019-10-02T10:11:40.000Z

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Compilation_Unit_Vectors; with Program.Contexts; with Program.Source_Buffers; with Program.Symbols; with Program.Visibility; private with Ada.Containers.Hashed_Maps; private with Ada.Containers.Vectors; private with Program.Compilation_Units; private with Program.Compilations; private with Program.Symbols.Tables; package Program.Plain_Contexts is pragma Preelaborate; type Context is limited new Program.Contexts.Context with private; procedure Initialize (Self : in out Context'Class); procedure Find_Or_Create_Symbol (Self : in out Context'Class; Buffer : not null Program.Source_Buffers.Source_Buffer_Access; Span : Program.Source_Buffers.Span; Result : out Program.Symbols.Symbol); function Find (Self : Context'Class; Value : Program.Text) return Program.Symbols.Symbol; procedure Parse_File (Self : aliased in out Context'Class; Text_Name : Text; Env : aliased in out Program.Visibility.Context); overriding function Library_Unit_Declarations (Self : Context) return Program.Compilation_Unit_Vectors.Compilation_Unit_Vector_Access; overriding function Compilation_Unit_Bodies (Self : Context) return Program.Compilation_Unit_Vectors.Compilation_Unit_Vector_Access; private type Symbol_List_Index is range 0 .. Integer'Last; function Hash (Value : Symbol_List_Index) return Ada.Containers.Hash_Type is (Ada.Containers.Hash_Type'Mod (Value)); type Symbol_List_Item is record Prefix : Symbol_List_Index; Symbol : Program.Symbols.Symbol; end record; function Hash (Value : Symbol_List_Item) return Ada.Containers.Hash_Type; package Symbol_List_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Symbol_List_Item, Element_Type => Symbol_List_Index, Hash => Hash, Equivalent_Keys => "="); package Unit_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Symbol_List_Index, Element_Type => Program.Compilation_Units.Compilation_Unit_Access, Hash => Hash, Equivalent_Keys => "=", "=" => Program.Compilation_Units."="); package Unit_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Program.Compilation_Units.Compilation_Unit_Access, "=" => Program.Compilation_Units."="); type Unit_Vector (Context : access Program.Plain_Contexts.Context) is limited new Program.Compilation_Unit_Vectors.Compilation_Unit_Vector with record Map : Unit_Maps.Map; List : Unit_Vectors.Vector; end record; overriding function Get_Length (Self : Unit_Vector) return Positive; overriding function Element (Self : Unit_Vector; Index : Positive) return not null Program.Compilation_Units.Compilation_Unit_Access; overriding function Find_Unit (Self : Unit_Vector; Name : Text) return Program.Compilation_Units.Compilation_Unit_Access; package Compilation_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Program.Compilations.Compilation_Access, "=" => Program.Compilations."="); type Context is limited new Program.Contexts.Context with record Symbols : Program.Symbols.Tables.Symbol_Table; Symbol_Lists : Symbol_List_Maps.Map; Declarations : aliased Unit_Vector (Context'Unchecked_Access); Bodies : aliased Unit_Vector (Context'Unchecked_Access); Compilations : Compilation_Vectors.Vector; end record; end Program.Plain_Contexts;

34.098214

79

0.707777

8b9e3d4669c2429471c1d41079fec176bd147437

5,548

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52104r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52104r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52104r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C52104R.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT LENGTHS MUST MATCH IN ARRAY AND SLICE ASSIGNMENTS. -- MORE SPECIFICALLY, TEST THAT ATTEMPTED ASSIGNMENTS BETWEEN -- ARRAYS WITH NON-MATCHING LENGTHS LEAVE THE DESTINATION ARRAY -- INTACT AND CAUSE CONSTRAINT_ERROR TO BE RAISED. -- (OVERLAPS BETWEEN THE OPERANDS OF THE ASSIGNMENT STATEMENT -- ARE TREATED ELSEWHERE.) -- THIS IS THE THIRD FILE IN -- DIVISION D : NULL LENGTHS NOT DETERMINABLE STATICALLY. -- RM 07/20/81 -- SPS 3/22/83 WITH REPORT; PROCEDURE C52104R IS USE REPORT ; BEGIN TEST( "C52104R" , "CHECK THAT IN ARRAY ASSIGNMENTS AND IN SLICE" & " ASSIGNMENTS THE LENGTHS MUST MATCH" ); -- ( EACH DIVISION COMPRISES 3 FILES, -- COVERING RESPECTIVELY THE FIRST -- 3 , NEXT 2 , AND LAST 3 OF THE 8 -- SELECTIONS FOR THE DIVISION.) ------------------------------------------------------------------- -- (7) UNSLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' (BY -- THEMSELVES). DECLARE ARR71 : STRING( IDENT_INT(1)..IDENT_INT(1) ) := "A" ; ARR72 : STRING( IDENT_INT(5)..IDENT_INT(4) ) := "" ; BEGIN -- STRING ASSIGNMENT: ARR72 := ARR71 ; FAILED( "EXCEPTION NOT RAISED - SUBTEST 7" ); EXCEPTION WHEN CONSTRAINT_ERROR => -- CHECKING THE VALUES AFTER THE STRING ASSIGNMENT: IF ARR72 /= "" THEN FAILED( "ORIGINAL VALUE ALTERED (7)" ); END IF; WHEN OTHERS => FAILED( "WRONG EXCEPTION RAISED - SUBTEST 7" ); END ; ------------------------------------------------------------------- -- (8) SLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' , WITH -- STRING LITERALS. -- DECLARE ARR82 : STRING( IDENT_INT(5)..IDENT_INT(9) ) ; BEGIN -- INITIALIZATION OF LHS ARRAY: ARR82( IDENT_INT(5)..IDENT_INT(9) ) := "QUINC" ; -- STRING LITERAL ASSIGNMENT: ARR82( IDENT_INT(5)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(5) ) := "ABC" ; FAILED( "EXCEPTION NOT RAISED - SUBTEST 8" ); EXCEPTION WHEN CONSTRAINT_ERROR => -- CHECKING THE VALUES AFTER THE STRING ASSIGNMENT: IF ARR82 /= "QUINC" OR ARR82( IDENT_INT(5)..IDENT_INT(9) ) /= "QUINC" THEN FAILED( "ORIGINAL VALUE ALTERED (8)" ); END IF; WHEN OTHERS => FAILED( "WRONG EXCEPTION RAISED - SUBTEST 8" ); END ; ------------------------------------------------------------------- -- (9) SLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' (BY -- THEMSELVES). -- DECLARE SUBTYPE TA92 IS STRING( IDENT_INT(5)..IDENT_INT(9) ) ; ARR91 : STRING( IDENT_INT(1)..IDENT_INT(5) ) := "ABCDE" ; ARR92 : TA92 ; BEGIN -- INITIALIZATION OF LHS ARRAY: ARR92( IDENT_INT(5)..IDENT_INT(9) ) := "QUINC" ; -- STRING SLICE ASSIGNMENT: ARR92( IDENT_INT(5)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(9) ) ( IDENT_INT(8)..IDENT_INT(7) ) := ARR91 ( IDENT_INT(1)..IDENT_INT(5) ) ( IDENT_INT(5)..IDENT_INT(7) ) ; FAILED( "EXCEPTION NOT RAISED - SUBTEST 9" ); EXCEPTION WHEN CONSTRAINT_ERROR => -- CHECKING THE VALUES AFTER THE STRING ASSIGNMENT: IF ARR92 /= "QUINC" OR ARR92( IDENT_INT(5)..IDENT_INT(9) ) /= "QUINC" THEN FAILED( "ORIGINAL VALUE ALTERED (9)" ); END IF; WHEN OTHERS => FAILED( "WRONG EXCEPTION RAISED - SUBTEST 9" ); END ; ------------------------------------------------------------------- RESULT ; END C52104R;

29.04712

79

0.50703

a0864c984c23bdb652e4d5fffd7e1a3b32f7e315

18,902

adb

Ada

thirdparty/adasdl/thin/adasdl/AdaSDL_gears/gears.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

thirdparty/adasdl/thin/adasdl/AdaSDL_gears/gears.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

thirdparty/adasdl/thin/adasdl/AdaSDL_gears/gears.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

-- 3-D gear wheels. -- ----------------------------------------------------- -- A more simple version of this program was originaly -- created in C by Brian Paul. -- ----------------------------------------------------- -- Conversion to Ada + SDL, and extensions, written by: -- Antonio F. Vargas - Ponta Delgada - Azores - Portugal -- [email protected] -- www.adapower.net/~avargas -- ----------------------------------------------------- -- This program is in the public domain -- ----------------------------------------------------- -- Command line options: -- -info Print GL implementation information -- (this is the original option). -- -slow To slow down velocity under acelerated -- hardware. -- -window GUI window. Fullscreen is the default. -- -nosound To play without sound. -- -800x600 To create a video display of 800 by 600 -- the default mode is 640x480 -- -1024x768 To create a video display of 1024 by 768 -- ----------------------------------------------------- with Interfaces.C; with Ada.Numerics.Generic_Elementary_Functions; with Ada.Command_Line; with Ada.Text_IO; use Ada.Text_IO; with GNAT.OS_Lib; with SDL.Video; with SDL.Timer; with SDL.Error; with SDL.Events; with SDL.Keyboard; with SDL.Keysym; with SDL.Types; use SDL.Types; with SDL_Mixer; with SDL.Audio; with gl_h; use gl_h; with AdaGL; use AdaGL; procedure gears is package CL renames Ada.Command_Line; package C renames Interfaces.C; use type C.unsigned; use type C.int; use type SDL.Init_Flags; package Vd renames SDL.Video; use type Vd.Surface_ptr; use type Vd.Surface_Flags; package Tm renames SDL.Timer; package Er renames SDL.Error; package Ev renames SDL.Events; package Kb renames SDL.Keyboard; package Ks renames SDL.Keysym; package Au renames SDL.Audio; use type Ks.SDLMod; package Mix renames SDL_Mixer; use type Mix.Chunk_ptr; T0 : GLint := 0; Frames : GLint := 0; -- =================================================================== -- Draw a gear wheel. You'll probably want to call this function when -- building a display list since we do a lot of trig here. -- Input: inner_radius - radius of hole at center -- outer_radius - radius at center of teeth -- width - width of gear -- teeth - number of teeth -- tooth_depth - depth of tooth -- =================================================================== procedure gear ( inner_radius : GLfloat; outer_radius : GLfloat; width : GLfloat; teeth : GLint; tooth_depth : GLfloat) is r0, r1, r2 : GLfloat; angle, da : GLfloat; u, v, len : GLfloat; Pi : constant := Ada.Numerics.Pi; package GLfloat_Math is new Ada.Numerics.Generic_Elementary_Functions (GLfloat); use GLfloat_Math; begin r0 := inner_radius; r1 := outer_radius - tooth_depth / 2.0; r2 := outer_radius + tooth_depth / 2.0; da := 2.0 * Pi / GLfloat (teeth) / 4.0; glShadeModel (GL_FLAT); glNormal3f (0.0, 0.0, 1.0); -- Draw front face glBegin (GL_QUAD_STRIP); for i in GLint range 0 .. teeth loop angle := GLfloat (i) * 2.2 * Pi / GLfloat (teeth); glVertex3f (r0 * Cos (angle), r0 * Sin (angle), width * 0.5); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), width * 0.5); if i < teeth then glVertex3f (r0 * Cos (angle), r0 * Sin (angle), width * 0.5); glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), width * 0.5); end if; end loop; glEnd; -- draw front sides of teeth glBegin (GL_QUADS); da := 2.0 * Pi / GLfloat (teeth) / 4.0; for i in GLint range 0 .. teeth - 1 loop angle := GLfloat (i) * 2.0 * Pi / GLfloat (teeth); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), width * 0.5); glVertex3f (r2 * Cos (angle + da), r2 * Sin (angle + da), width * 0.5); glVertex3f (r2 * Cos (angle + 2.0 * da), r2 * Sin (angle + 2.0 * da), width * 0.5); glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), width * 0.5); end loop; glEnd; glNormal3f (0.0, 0.0, -1.0); -- draw back face glBegin (GL_QUAD_STRIP); for i in GLint range 0 .. teeth loop angle := GLfloat (i) * 2.0 * Pi / GLfloat (teeth); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), -width * 0.5); glVertex3f (r0 * Cos (angle), r0 * Sin (angle), -width * 0.5); if i < teeth then glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), -width * 0.5); glVertex3f (r0 * Cos (angle), r0 * Sin (angle), -width * 0.5); end if; end loop; glEnd; -- draw back sides of teeth glBegin (GL_QUADS); da := 2.0 * Pi / GLfloat (teeth) /4.0; for i in GLint range 0 .. teeth - 1 loop angle := GLfloat (i) * 2.0 * Pi / GLfloat (teeth); glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), -width * 0.5); glVertex3f (r2 * Cos (angle + 2.0 * da), r2 * Sin (angle + 2.0 * da), -width * 0.5); glVertex3f (r2 * Cos (angle + da), r2 * Sin (angle + da), -width * 0.5); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), -width * 0.5); end loop; glEnd; -- draw outward face of teeth glBegin (GL_QUAD_STRIP); for i in GLint range 0 .. teeth - 1 loop angle := GLfloat (i) * 2.0 * Pi / GLfloat (teeth); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), width * 0.5); glVertex3f (r1 * Cos (angle), r1 * Sin (angle), -width * 0.5); u := r2 * Cos (angle + da) - r1 * Cos (angle); v := r2 * Sin (angle + da) - r1 * Sin (angle); len := Sqrt (u**2 + v**2); u := u / len; v := v / len; glNormal3f (v, -u, 0.0); glVertex3f (r2 * Cos (angle + da), r2 * Sin (angle + da), width * 0.5); glVertex3f (r2 * Cos (angle + da), r2 * Sin (angle + da), -width * 0.5); glNormal3f (Cos (angle), Sin (angle), 0.0); glVertex3f (r2 * Cos (angle + 2.0 * da), r2 * Sin (angle + 2.0 * da), width * 0.5); glVertex3f (r2 * Cos (angle + 2.0 * da), r2 * Sin (angle + 2.0 * da), -width * 0.5); u := r1 * Cos (angle + 3.0 * da) - r2 * Cos (angle + 2.0 * da); v := r1 * Sin (angle + 3.0 * da) - r2 * Sin (angle + 2.0 * da); glNormal3f (v, -u, 0.0); glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), width * 0.5); glVertex3f (r1 * Cos (angle + 3.0 * da), r1 * Sin (angle + 3.0 * da), -width * 0.5); glNormal3f (Cos (angle), Sin (angle), 0.0); end loop; glVertex3f (r1 * Cos (0.0), r1 * Sin (0.0), width * 0.5); glVertex3f (r1 * Cos (0.0), r1 * Sin (0.0), -width * 0.5); glEnd; glShadeModel (GL_SMOOTH); -- draw inside radius cylinder glBegin (GL_QUAD_STRIP); for i in GLint range 0 .. teeth loop angle := GLfloat (i) * 2.0 * Pi / GLfloat (teeth); glNormal3f (-Cos (angle), -Sin (angle), 0.0); glVertex3f (r0 * Cos (angle), r0 * Sin (angle), -width * 0.5); glVertex3f (r0 * Cos (angle), r0 * Sin (angle), width * 0.5); end loop; glEnd; end gear; -- =================================================================== view_rotx : GLfloat := 20.0; view_roty : GLfloat := 30.0; view_rotz : GLfloat := 0.0; gear1, gear2, gear3 : GLuint; angle : GLfloat := 0.0; -- =================================================================== procedure draw is begin glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT); glPushMatrix; glRotatef (view_rotx, 1.0, 0.0, 0.0); glRotatef (view_roty, 0.0, 1.0, 0.0); glRotatef (view_rotz, 0.0, 0.0, 1.0); glPushMatrix; glTranslatef (-3.0, -2.0, 0.0); glRotatef (angle, 0.0, 0.0, 1.0); glCallList (gear1); glPopMatrix; glPushMatrix; glTranslatef (3.1, -2.0, 0.0); glRotatef (-2.0 * angle - 9.0, 0.0, 0.0, 1.0); glCallList (gear2); glPopMatrix; glPushMatrix; glTranslatef (-3.1, 4.2, 0.0); glRotatef (-2.0 * angle - 25.0, 0.0, 0.0, 1.0); glCallList (gear3); glPopMatrix; glPopMatrix; Vd.GL_SwapBuffers; Frames := Frames + 1; declare t : GLint := GLint (Tm.GetTicks); begin if t - T0 >= 5000 then declare seconds : GLfloat := GLfloat (t - T0) / 1000.0; fps : GLfloat := GLfloat (Frames) / seconds; package GLfloat_IO is new Ada.Text_IO.Float_IO (GLfloat); use GLfloat_IO; begin Put (GLint'Image (Frames) & " frames in "); Put (seconds, 4, 2, 0); Put (" seconds = "); Put (fps, 4, 2, 0); Put_Line (" FPS"); T0 := t; Frames := 0; end; end if; end; -- declare end draw; -- =================================================================== procedure idle is begin angle := angle + 2.0; end idle; -- =================================================================== -- New window size of exposure procedure reshape (width : C.int; height : C.int) is h : GLdouble := GLdouble (height) / GLdouble (width); begin glViewport (0, 0, GLint (width), GLint (height)); glMatrixMode (GL_PROJECTION); glLoadIdentity; glFrustum (-1.0, 1.0, -h, h, 5.0, 60.0); glMatrixMode (GL_MODELVIEW); glLoadIdentity; glTranslatef (0.0, 0.0, -40.0); end reshape; -- =================================================================== procedure init (info : Boolean) is pos : Four_GLfloat_Vector := (5.0, 5.0, 10.0, 0.0); red : Four_GLfloat_Vector := (0.8, 0.1, 0.0, 1.0); green : Four_GLfloat_Vector := (0.0, 0.8, 0.2, 1.0); blue : Four_GLfloat_Vector := (0.2, 0.2, 1.0, 1.0); begin glLightfv (GL_LIGHT0, GL_POSITION, pos); glEnable (GL_CULL_FACE); glEnable (GL_LIGHTING); glEnable (GL_LIGHT0); glEnable (GL_DEPTH_TEST); -- make the gears gear1 := glGenLists (1); glNewList (gear1, GL_COMPILE); glMaterialfv (GL_FRONT, GL_AMBIENT_AND_DIFFUSE, red); gear (1.0, 4.0, 1.0, 20, 0.7); glEndList; gear2 := glGenLists (1); glNewList (gear2, GL_COMPILE); glMaterialfv (GL_FRONT, GL_AMBIENT_AND_DIFFUSE, green); gear (0.5, 2.0, 2.0, 10, 0.7); glEndList; gear3 := glGenLists (1); glNewList (gear3, GL_COMPILE); glMaterialfv (GL_FRONT, GL_AMBIENT_AND_DIFFUSE, blue); gear (1.3, 2.0, 0.5, 10, 0.7); glEndList; glEnable (GL_NORMALIZE); if info then Put_Line ("GL_RENDER = " & glGetString (GL_RENDER)); Put_Line ("GL_VERSION = " & glGetString (GL_VERSION)); Put_Line ("GL_VENDOR = " & glGetString (GL_VENDOR)); Put_Line ("GL_EXTENSIONS = " & glGetString (GL_EXTENSIONS)); end if; end init; -- =================================================================== procedure Load_Sound (wave : in out Mix.Chunk_ptr; file : String) is begin wave := Mix.Load_WAV (file); if wave = Mix.null_Chunk_ptr then Put_Line ("Couldn't load " & file & ": " & Mix.Get_Error); GNAT.OS_Lib.OS_Exit (2); end if; end Load_Sound; -- =================================================================== procedure Stop_Sound (wave : in out Mix.Chunk_ptr) is begin if wave /= Mix.null_Chunk_ptr then Mix.FreeChunk (wave); wave := Mix.null_Chunk_ptr; end if; end Stop_Sound; -- =================================================================== screen : Vd.Surface_ptr; done : Boolean; keys : Uint8_ptr; Screen_Width : C.int := 640; Screen_Hight : C.int := 480; Slowly : Boolean := False; Info : Boolean := False; Full_Screen : Boolean := True; Sound : Boolean := True; argc : Integer := CL.Argument_Count; Video_Flags : Vd.Surface_Flags := 0; Initialization_Flags : SDL.Init_Flags := 0; -- =================================================================== procedure Manage_Command_Line is begin while argc > 0 loop if CL.Argument (argc) = "-slow" then Slowly := True; argc := argc - 1; elsif CL.Argument (argc) = "-window" then Full_Screen := False; argc := argc - 1; elsif CL.Argument (argc) = "-1024x768" then Screen_Width := 1024; Screen_Hight := 768; argc := argc - 1; elsif CL.Argument (argc) = "-800x600" then Screen_Width := 800; Screen_Hight := 600; argc := argc - 1; elsif CL.Argument (argc) = "-info" then Info := True; argc := argc - 1; elsif CL.Argument (argc) = "-nosound" then Sound := False; argc := argc - 1; else Put_Line ("Usage: " & CL.Command_Name & " " & "[-slow] [-nosound] [-window] [-h] " & "[[-800x600] | [-1024x768]]"); argc := argc - 1; GNAT.OS_Lib.OS_Exit (0); end if; end loop; end Manage_Command_Line; -- =================================================================== Gears_Working_Wave : Mix.Chunk_ptr := Mix.null_Chunk_ptr; System_Rotation_Wave : Mix.Chunk_ptr := Mix.null_Chunk_ptr; -- =================================================================== procedure Initialize_Sound is begin if Sound then if Mix.OpenAudio (22050, Au.AUDIO_S16, 2, 4096) < 0 then Put_Line ("Couldn't open audio " & Mix.Get_Error); GNAT.OS_Lib.OS_Exit (2); end if; Load_Sound (Gears_Working_Wave, "gears_working.wav"); Mix.PlayChannel (0, Gears_Working_Wave, -1); Load_Sound (System_Rotation_Wave, "system_rotation.wav"); end if; -- Sound end Initialize_Sound; -- =================================================================== procedure Main_System_Loop is begin while not done loop declare event : Ev.Event; PollEvent_Result : C.int; begin idle; loop Ev.PollEventVP (PollEvent_Result, event); exit when PollEvent_Result = 0; case event.the_type is when Ev.VIDEORESIZE => screen := Vd.SetVideoMode ( event.resize.w, event.resize.h, 16, Vd.OPENGL or Vd.RESIZABLE); if screen /= null then reshape (screen.w, screen.h); else -- Uh oh, we couldn't set the new video mode?? null; end if; when Ev.QUIT => done := True; when others => null; end case; end loop; keys := Kb.GetKeyState (null); if Kb.Is_Key_Pressed (keys, Ks.K_ESCAPE) then done := True; end if; if Kb.Is_Key_Pressed (keys, Ks.K_UP) then view_rotx := view_rotx + 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); end if; if Kb.Is_Key_Pressed (keys, Ks.K_DOWN) then view_rotx := view_rotx - 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); end if; if Kb.Is_Key_Pressed (keys, Ks.K_LEFT) then view_roty := view_roty + 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); end if; if Kb.Is_Key_Pressed (keys, Ks.K_RIGHT) then view_roty := view_roty - 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); end if; if Kb.Is_Key_Pressed (keys, Ks.K_z) then if (Kb.GetModState and Ks.KMOD_SHIFT) /= 0 then view_rotz := view_rotz - 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); else view_rotz := view_rotz + 5.0; Mix.PlayChannel (-1, System_Rotation_Wave, 0); end if; end if; -- Allow the user what's happening if Slowly then Tm.SDL_Delay (23); end if; draw; end; -- declare end loop; end Main_System_Loop; -- =================================================================== -- Gears Procedure body -- =================================================================== begin Manage_Command_Line; Initialization_Flags := SDL.INIT_VIDEO; if Sound then Initialization_Flags := Initialization_Flags or SDL.INIT_AUDIO; end if; if SDL.Init (Initialization_Flags) < 0 then Put_Line ("Couldn't load SDL: " & Er.Get_Error); GNAT.OS_Lib.OS_Exit (1); end if; Video_Flags := Vd.OPENGL or Vd.RESIZABLE; if Full_Screen then Video_Flags := Video_Flags or Vd.FULLSCREEN; end if; screen := Vd.SetVideoMode (Screen_Width, Screen_Hight, 16, Video_Flags); if screen = null then Put_Line ("Couldn't set " & C.int'Image (Screen_Width) & "x" & C.int'Image (Screen_Hight) & " GL video mode: " & Er.Get_Error); SDL.SDL_Quit; GNAT.OS_Lib.OS_Exit (2); end if; Vd.WM_Set_Caption ("Gears", "gears"); Initialize_Sound; init (Info); reshape (screen.w, screen.h); done := False; Main_System_Loop; if Sound then Stop_Sound (Gears_Working_Wave); Mix.CloseAudio; end if; -- Sound SDL.SDL_Quit; end gears;

33.161404

81

0.479103

8b9d0527d885e0b5f20f749c533bba2e59ab78e4

9,421

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-solita.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-solita.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-solita.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . S O F T _ L I N K S . T A S K I N G -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Style_Checks (All_Checks); -- Turn off subprogram alpha ordering check, since we group soft link bodies -- and dummy soft link bodies together separately in this unit. pragma Polling (Off); -- Turn polling off for this package. We don't need polling during any of the -- routines in this package, and more to the point, if we try to poll it can -- cause infinite loops. with Ada.Exceptions; with Ada.Exceptions.Is_Null_Occurrence; with System.Task_Primitives.Operations; with System.Tasking; with System.Stack_Checking; with System.Secondary_Stack; package body System.Soft_Links.Tasking is package STPO renames System.Task_Primitives.Operations; package SSL renames System.Soft_Links; use Ada.Exceptions; use type System.Secondary_Stack.SS_Stack_Ptr; use type System.Tasking.Task_Id; use type System.Tasking.Termination_Handler; ---------------- -- Local Data -- ---------------- Initialized : Boolean := False; -- Boolean flag that indicates whether the tasking soft links have -- already been set. ----------------------------------------------------------------- -- Tasking Versions of Services Needed by Non-Tasking Programs -- ----------------------------------------------------------------- function Get_Jmpbuf_Address return Address; procedure Set_Jmpbuf_Address (Addr : Address); -- Get/Set Jmpbuf_Address for current task function Get_Sec_Stack return SST.SS_Stack_Ptr; procedure Set_Sec_Stack (Stack : SST.SS_Stack_Ptr); -- Get/Set location of current task's secondary stack procedure Timed_Delay_T (Time : Duration; Mode : Integer); -- Task-safe version of SSL.Timed_Delay procedure Task_Termination_Handler_T (Excep : SSL.EO); -- Task-safe version of the task termination procedure function Get_Stack_Info return Stack_Checking.Stack_Access; -- Get access to the current task's Stack_Info -------------------------- -- Soft-Link Get Bodies -- -------------------------- function Get_Jmpbuf_Address return Address is begin return STPO.Self.Common.Compiler_Data.Jmpbuf_Address; end Get_Jmpbuf_Address; function Get_Sec_Stack return SST.SS_Stack_Ptr is begin return Result : constant SST.SS_Stack_Ptr := STPO.Self.Common.Compiler_Data.Sec_Stack_Ptr do pragma Assert (Result /= null); end return; end Get_Sec_Stack; function Get_Stack_Info return Stack_Checking.Stack_Access is begin return STPO.Self.Common.Compiler_Data.Pri_Stack_Info'Access; end Get_Stack_Info; -------------------------- -- Soft-Link Set Bodies -- -------------------------- procedure Set_Jmpbuf_Address (Addr : Address) is begin STPO.Self.Common.Compiler_Data.Jmpbuf_Address := Addr; end Set_Jmpbuf_Address; procedure Set_Sec_Stack (Stack : SST.SS_Stack_Ptr) is begin STPO.Self.Common.Compiler_Data.Sec_Stack_Ptr := Stack; end Set_Sec_Stack; ------------------- -- Timed_Delay_T -- ------------------- procedure Timed_Delay_T (Time : Duration; Mode : Integer) is Self_Id : constant System.Tasking.Task_Id := STPO.Self; begin -- In case pragma Detect_Blocking is active then Program_Error -- must be raised if this potentially blocking operation -- is called from a protected operation. if System.Tasking.Detect_Blocking and then Self_Id.Common.Protected_Action_Nesting > 0 then raise Program_Error with "potentially blocking operation"; else Abort_Defer.all; STPO.Timed_Delay (Self_Id, Time, Mode); Abort_Undefer.all; end if; end Timed_Delay_T; -------------------------------- -- Task_Termination_Handler_T -- -------------------------------- procedure Task_Termination_Handler_T (Excep : SSL.EO) is Self_Id : constant System.Tasking.Task_Id := STPO.Self; Cause : System.Tasking.Cause_Of_Termination; EO : Ada.Exceptions.Exception_Occurrence; begin -- We can only be here because we are terminating the environment task. -- Task termination for all other tasks is handled in the Task_Wrapper. -- We do not want to enable this check and e.g. call System.OS_Lib.Abort -- here because some restricted run-times may not have System.OS_Lib -- and calling abort may do more harm than good to the main application. pragma Assert (Self_Id = STPO.Environment_Task); -- Normal task termination if Is_Null_Occurrence (Excep) then Cause := System.Tasking.Normal; Ada.Exceptions.Save_Occurrence (EO, Ada.Exceptions.Null_Occurrence); -- Abnormal task termination elsif Exception_Identity (Excep) = Standard'Abort_Signal'Identity then Cause := System.Tasking.Abnormal; Ada.Exceptions.Save_Occurrence (EO, Ada.Exceptions.Null_Occurrence); -- Termination because of an unhandled exception else Cause := System.Tasking.Unhandled_Exception; Ada.Exceptions.Save_Occurrence (EO, Excep); end if; -- There is no need for explicit protection against race conditions for -- this part because it can only be executed by the environment task -- after all the other tasks have been finalized. Note that there is no -- fall-back handler which could apply to this environment task because -- it has no parents, and, as specified in ARM C.7.3 par. 9/2, "the -- fall-back handler applies only to the dependent tasks of the task". if Self_Id.Common.Specific_Handler /= null then Self_Id.Common.Specific_Handler.all (Cause, Self_Id, EO); end if; end Task_Termination_Handler_T; ----------------------------- -- Init_Tasking_Soft_Links -- ----------------------------- procedure Init_Tasking_Soft_Links is begin -- Set links only if not set already if not Initialized then -- Mark tasking soft links as initialized Initialized := True; -- The application being executed uses tasking so that the tasking -- version of the following soft links need to be used. SSL.Get_Jmpbuf_Address := Get_Jmpbuf_Address'Access; SSL.Set_Jmpbuf_Address := Set_Jmpbuf_Address'Access; SSL.Get_Sec_Stack := Get_Sec_Stack'Access; SSL.Get_Stack_Info := Get_Stack_Info'Access; SSL.Set_Sec_Stack := Set_Sec_Stack'Access; SSL.Timed_Delay := Timed_Delay_T'Access; SSL.Task_Termination_Handler := Task_Termination_Handler_T'Access; -- No need to create a new secondary stack, since we will use the -- default one created in s-secsta.adb. SSL.Set_Sec_Stack (SSL.Get_Sec_Stack_NT); SSL.Set_Jmpbuf_Address (SSL.Get_Jmpbuf_Address_NT); end if; pragma Assert (Get_Sec_Stack /= null); end Init_Tasking_Soft_Links; end System.Soft_Links.Tasking;

39.919492

79

0.581892

a07196c3888d0498aac242af9b1d7f52d0be08e5

3,712

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-tasatt.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-tasatt.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-tasatt.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T A S K _ A T T R I B U T E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Task_Identification; generic type Attribute is private; Initial_Value : Attribute; package Ada.Task_Attributes is type Attribute_Handle is access all Attribute; function Value (T : Ada.Task_Identification.Task_Id := Ada.Task_Identification.Current_Task) return Attribute; function Reference (T : Ada.Task_Identification.Task_Id := Ada.Task_Identification.Current_Task) return Attribute_Handle; procedure Set_Value (Val : Attribute; T : Ada.Task_Identification.Task_Id := Ada.Task_Identification.Current_Task); procedure Reinitialize (T : Ada.Task_Identification.Task_Id := Ada.Task_Identification.Current_Task); private pragma Inline (Value); pragma Inline (Set_Value); pragma Inline (Reinitialize); end Ada.Task_Attributes;

52.28169

78

0.491379

a01584f704db052cabb018d9784ece4f54d9a596

287

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert9.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert9.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert9.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-O -fdump-rtl-final" } package body Unchecked_Convert9 is procedure Proc is L : Unsigned_32 := 16#55557777#; begin Var := Conv (L); end; end Unchecked_Convert9; -- { dg-final { scan-rtl-dump-times "set \\(mem/v" 1 "final" } }

19.133333

64

0.609756

38b03f9e4b99f423c7e9d1755f3f54bb62a07db4

8,602

ads

Ada

src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads

rose-compiler/rose

01d7439081c13c12ecbca312c04908fe0787f37a

[ "BSD-3-Clause" ]

488

2015-01-09T08:54:48.000Z

2022-03-30T07:15:46.000Z

src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads

rose-compiler/rose

01d7439081c13c12ecbca312c04908fe0787f37a

[ "BSD-3-Clause" ]

174

2015-01-28T18:41:32.000Z

2022-03-31T16:51:05.000Z

src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads

rose-compiler/rose

01d7439081c13c12ecbca312c04908fe0787f37a

[ "BSD-3-Clause" ]

146

2015-04-27T02:48:34.000Z

2022-03-04T07:32:53.000Z

with Ada.Strings.Unbounded; with A_Nodes; with Dot; with Indented_Text; private with Ada.Exceptions; private with Ada.Text_IO; private with Ada.Wide_Text_IO; private with Asis; private with Asis.Set_Get; private with Interfaces.C.Extensions; private with Interfaces.C.Strings; private with Unchecked_Conversion; -- GNAT-specific: private with A4G.A_Types; private with Types; private with a_nodes_h.Support; -- Contains supporting declarations for child packages package Asis_Adapter is -- Controls behavior of Trace_ routines. Renamed here so clients have to -- with fewer packages: Trace_On : Boolean renames Indented_Text.Trace_On; Log_On : Boolean ; type Outputs_Record is record -- Initialized Output_Dir : Ada.Strings.Unbounded.Unbounded_String; -- Initialized A_Nodes : Standard.A_Nodes.Access_Class; -- Initialized Graph : Dot.Graphs.Access_Class; -- Initialized Text : Indented_Text.Access_Class; -- Initialized end record; -- Raised when a subprogram is called incorrectly: Usage_Error : Exception; -- Raised when an external routine fails and the subprogram cannot continue: External_Error : Exception; -- Raised when an external routine raises a usage-error-like exception or -- there is an internal logic error: Internal_Error : Exception; private Module_Name : constant String := "Asis_Adapter"; package AEX renames Ada.Exceptions; package ASU renames Ada.Strings.Unbounded; package ATI renames Ada.Text_IO; package AWTI renames Ada.Wide_Text_IO; package IC renames Interfaces.C; package ICE renames Interfaces.C.Extensions; package ICS renames Interfaces.C.Strings; package anhS renames a_nodes_h.Support; function To_String (Item : in Wide_String) return String; function To_Quoted_String (Item : in Wide_String) return String; function "+"(Item : in Wide_String) return String renames To_String; function To_Wide_String (Item : in String) return Wide_String; function "+"(Item : in String) return Wide_String renames To_Wide_String; function To_Chars_Ptr (Item : in Wide_String) return Interfaces.C.Strings.chars_ptr; function To_Chars_Ptr (Item : in String) return Interfaces.C.Strings.chars_ptr renames Interfaces.C.Strings.New_String; procedure Put (Item : in String) renames ATI.Put; procedure Put_Line (Item : in String) renames ATI.Put_Line; procedure Put_Wide (Item : in Wide_String) renames AWTI.Put; procedure Put_Line_Wide (Item : in Wide_String) renames AWTI.Put_Line; procedure Trace_Put (Message : in Wide_String) renames Indented_Text.Trace_Put; procedure Trace_Put_Line (Message : in Wide_String) renames Indented_Text.Trace_Put_Line; -- Provides routines that peofix the output with the name of the current -- module: generic Module_Name : in string; package Generic_Logging is procedure Log (Message : in String); procedure Log_Wide (Message : in Wide_String); procedure Log_Exception (X : in Aex.Exception_Occurrence); end Generic_Logging; -- Returns the image minus the leading space: function Spaceless_Image (Item : in Natural) return String; function NLB_Image (Item : in Natural) return String renames Spaceless_Image; type ID_Kind is (Unit_ID_Kind, Element_ID_Kind); function To_String (Id : in IC.int; Kind : in ID_Kind) return String; function To_Dot_ID_Type (Id : in IC.int; Kind : in ID_Kind) return Dot.ID_Type; -- String: -- Add <Name> => <Value> to the label, and print it if trace is on: procedure Add_To_Dot_Label (Dot_Label : in out Dot.HTML_Like_Labels.Class; Outputs : in out Outputs_Record; Name : in String; Value : in String); -- Boolean: -- Add <Name> => <Value> to the label, and print it if trace is on: -- ONLY acts if Value = True: procedure Add_To_Dot_Label (Dot_Label : in out Dot.HTML_Like_Labels.Class; Outputs : in out Outputs_Record; Name : in String; Value : in Boolean); -- String: -- Add <Value> to the label, and print it if trace is on: procedure Add_To_Dot_Label (Dot_Label : in out Dot.HTML_Like_Labels.Class; Outputs : in out Outputs_Record; Value : in String); -- Unit_ID or Element_ID: -- Add an edge node to the the dot graph: -- Use for both Unit_ID and Element_ID: procedure Add_Dot_Edge (Outputs : in out Outputs_Record; From : in IC.int; From_Kind : in ID_Kind; To : in IC.int; To_Kind : in ID_Kind; Label : in String); -- Order below is alphabetical: function To_Access_Definition_Kinds is new Unchecked_Conversion (Source => Asis.Access_Definition_Kinds, Target => a_nodes_h.Access_Definition_Kinds); function To_Access_Type_Kinds is new Unchecked_Conversion (Source => Asis.Access_Type_Kinds, Target => a_nodes_h.Access_Type_Kinds); function To_Association_Kinds is new Unchecked_Conversion (Source => Asis.Association_Kinds, Target => a_nodes_h.Association_Kinds); function To_Attribute_Kinds is new Unchecked_Conversion (Source => Asis.Attribute_Kinds, Target => a_nodes_h.Attribute_Kinds); function To_Clause_Kinds is new Unchecked_Conversion (Source => Asis.Clause_Kinds, Target => a_nodes_h.Clause_Kinds); function To_Representation_Clause_Kinds is new Unchecked_Conversion (Source => Asis.Representation_Clause_Kinds, Target => a_nodes_h.Representation_Clause_Kinds); function To_Constraint_Kinds is new Unchecked_Conversion (Source => Asis.Constraint_Kinds, Target => a_nodes_h.Constraint_Kinds); function To_Declaration_Kinds is new Unchecked_Conversion (Source => Asis.Declaration_Kinds, Target => a_nodes_h.Declaration_Kinds); function To_Declaration_Origins is new Unchecked_Conversion (Source => Asis.Declaration_Origins, Target => a_nodes_h.Declaration_Origins); function To_Defining_Name_Kinds is new Unchecked_Conversion (Source => Asis.Defining_Name_Kinds, Target => a_nodes_h.Defining_Name_Kinds); function To_Definition_Kinds is new Unchecked_Conversion (Source => Asis.Definition_Kinds, Target => a_nodes_h.Definition_Kinds); function To_Discrete_Range_Kinds is new Unchecked_Conversion (Source => Asis.Discrete_Range_Kinds, Target => a_nodes_h.Discrete_Range_Kinds); function To_Element_Kinds is new Unchecked_Conversion (Source => Asis.Element_Kinds, Target => a_nodes_h.Element_Kinds); function To_Expression_Kinds is new Unchecked_Conversion (Source => Asis.Expression_Kinds, Target => a_nodes_h.Expression_Kinds); function To_Formal_Type_Kinds is new Unchecked_Conversion (Source => Asis.Formal_Type_Kinds, Target => a_nodes_h.Formal_Type_Kinds); function To_Mode_Kinds is new Unchecked_Conversion (Source => Asis.Mode_Kinds, Target => a_nodes_h.Mode_Kinds); function To_Operator_Kinds is new Unchecked_Conversion (Source => Asis.Operator_Kinds, Target => a_nodes_h.Operator_Kinds); function To_Path_Kinds is new Unchecked_Conversion (Source => Asis.Path_Kinds, Target => a_nodes_h.Path_Kinds); function To_Pragma_Kinds is new Unchecked_Conversion (Source => Asis.Pragma_Kinds, Target => a_nodes_h.Pragma_Kinds); function To_Root_Type_Kinds is new Unchecked_Conversion (Source => Asis.Root_Type_Kinds, Target => a_nodes_h.Root_Type_Kinds); function To_Statement_Kinds is new Unchecked_Conversion (Source => Asis.Statement_Kinds, Target => a_nodes_h.Statement_Kinds); function To_Subprogram_Default_Kinds is new Unchecked_Conversion (Source => Asis.Subprogram_Default_Kinds, Target => a_nodes_h.Subprogram_Default_Kinds); function To_Type_Kinds is new Unchecked_Conversion (Source => Asis.Type_Kinds, Target => a_nodes_h.Type_Kinds); function To_Unit_Classes is new Unchecked_Conversion (Source => Asis.Unit_Classes, Target => a_nodes_h.Unit_Classes); function To_Unit_Kinds is new Unchecked_Conversion (Source => Asis.Unit_Kinds, Target => a_nodes_h.Unit_Kinds); function To_Unit_Origins is new Unchecked_Conversion (Source => Asis.Unit_Origins, Target => a_nodes_h.Unit_Origins); -- End alphabetical order end Asis_Adapter;

34.270916

80

0.717973

388dbda24c23fd363be56328dc03dde3bc68576d

4,466

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/g-regpat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/g-regpat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/g-regpat.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . R E G P A T -- -- -- -- S p e c -- -- -- -- Copyright (C) 1986 by University of Toronto. -- -- Copyright (C) 1996-2010, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package implements roughly the same set of regular expressions as -- are available in the Perl or Python programming languages. -- This is an extension of the original V7 style regular expression library -- written in C by Henry Spencer. Apart from the translation to Ada, the -- interface has been considerably changed to use the Ada String type -- instead of C-style nul-terminated strings. -- See file s-regpat.ads for full documentation of the interface ------------------------------------------------------------ -- Summary of Pattern Matching Packages in GNAT Hierarchy -- ------------------------------------------------------------ -- There are three related packages that perform pattern matching functions. -- the following is an outline of these packages, to help you determine -- which is best for your needs. -- GNAT.Regexp (files g-regexp.ads/s-regexp.ads/s-regexp.adb) -- This is a simple package providing Unix-style regular expression -- matching with the restriction that it matches entire strings. It -- is particularly useful for file name matching, and in particular -- it provides "globbing patterns" that are useful in implementing -- unix or DOS style wild card matching for file names. -- GNAT.Regpat (files g-regpat.ads/s-regpat.ads/s-regpat.adb) -- This is a more complete implementation of Unix-style regular -- expressions, copied from the Perl regular expression engine, -- written originally in C by Henry Spencer. It is functionally the -- same as that library. -- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb) -- This is a completely general pattern matching package based on the -- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern -- language is modeled on context free grammars, with context sensitive -- extensions that provide full (type 0) computational capabilities. with System.Regpat; package GNAT.Regpat renames System.Regpat;

61.178082

78

0.509404

135184b9ee2e4b01c6c78388efa19e451c445f51

4,307

adb

Ada

src/base/beans/util-beans-factory.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

60

2015-01-18T23:05:34.000Z

2022-03-20T18:56:30.000Z

src/base/beans/util-beans-factory.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

20

2016-09-15T16:41:30.000Z

2022-03-29T22:02:32.000Z

src/base/beans/util-beans-factory.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

10

2015-02-13T04:00:45.000Z

2022-03-20T18:57:54.000Z

----------------------------------------------------------------------- -- util-beans-factory -- Bean Registration and Factory -- Copyright (C) 2009, 2010, 2015, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Log.Loggers; package body Util.Beans.Factory is -- The logger Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Util.Beans.Factory"); -- ------------------------------ -- Register under the given name a function to create the bean instance when -- it is accessed for a first time. The scope defines the scope of the bean. -- bean -- ------------------------------ procedure Register (Factory : in out Bean_Factory; Name : in String; Definition : in Bean_Definition_Access; Scope : in Scope_Type := REQUEST_SCOPE) is B : constant Simple_Binding_Access := new Simple_Binding '(Def => Definition, Scope => Scope); begin Log.Info ("Register bean '{0}' in scope {1}", Name, Scope_Type'Image (Scope)); Register (Factory, Name, B.all'Access); end Register; -- ------------------------------ -- Register under the given name a function to create the bean instance when -- it is accessed for a first time. The scope defines the scope of the bean. -- bean -- ------------------------------ procedure Register (Factory : in out Bean_Factory; Name : in String; Bind : in Binding_Access) is begin Log.Info ("Register bean binding '{0}'", Name); Factory.Map.Include (Key => To_Unbounded_String (Name), New_Item => Bind); end Register; -- ------------------------------ -- Register all the definitions from a factory to a main factory. -- ------------------------------ procedure Register (Factory : in out Bean_Factory; From : in Bean_Factory) is Pos : Bean_Maps.Cursor := Bean_Maps.First (From.Map); begin while Bean_Maps.Has_Element (Pos) loop Factory.Map.Include (Key => Bean_Maps.Key (Pos), New_Item => Bean_Maps.Element (Pos)); Bean_Maps.Next (Pos); end loop; end Register; -- ------------------------------ -- Create a bean by using the create operation registered for the name -- ------------------------------ procedure Create (Factory : in Bean_Factory; Name : in Unbounded_String; Result : out Util.Beans.Basic.Readonly_Bean_Access; Definition : out Bean_Definition_Access; Scope : out Scope_Type) is Pos : constant Bean_Maps.Cursor := Factory.Map.Find (Name); begin if Bean_Maps.Has_Element (Pos) then declare B : constant Binding_Access := Bean_Maps.Element (Pos); begin B.Create (Name, Result, Definition, Scope); end; end if; end Create; procedure Create (Factory : in Simple_Binding; Name : in Ada.Strings.Unbounded.Unbounded_String; Result : out Util.Beans.Basic.Readonly_Bean_Access; Definition : out Bean_Definition_Access; Scope : out Scope_Type) is pragma Unreferenced (Name); begin Result := Factory.Def.Create; Definition := Factory.Def; Scope := Factory.Scope; end Create; end Util.Beans.Factory;

41.815534

92

0.543534

572dd14f9a79ab37c882829cc361a4bb5993f669

1,801

adb

Ada

examples/object_hierarchy/object_hierarchy.adb

glencornell/ada-object-framework

76383688a26e1d46cd83ee9e6ab45621692cd7f8

[ "MIT" ]

null

examples/object_hierarchy/object_hierarchy.adb

glencornell/ada-object-framework

76383688a26e1d46cd83ee9e6ab45621692cd7f8

[ "MIT" ]

null

examples/object_hierarchy/object_hierarchy.adb

glencornell/ada-object-framework

76383688a26e1d46cd83ee9e6ab45621692cd7f8

[ "MIT" ]

null

with Ada.Strings.Unbounded.Text_Io; with Ada.Text_Io; with Aof.Core.Objects; with My_Objects; -- This example highlights what I envision to be a typical use of the -- object system. Here we define a widget object type (in the -- package Widgets), which is inherited from the Objects.Object base -- class. We then create several widgets and place them in an object -- hierarchy (different than the inheritance hierarchy). We then -- repaint the widgets. procedure Object_Hierarchy is procedure Dump_Object (This : in out Aof.Core.Objects.Access_Object) is begin Ada.Text_Io.Put_Line("Object: " & This.Get_Name); end; procedure Dump_Object_Tree is new Aof.Core.Objects.Iterate(Proc => Dump_Object); begin -- Set the object_name properties of the widgets: My_Objects.Top.Set_Name("Top"); My_Objects.Form.Set_Name("Form"); My_Objects.Label.Set_Name("Label"); My_Objects.Row_Column_Layout.Set_Name("Row_Column_Layout"); My_Objects.Ok.Set_Name("Ok"); My_Objects.Cancel.Set_Name("Cancel"); -- Construct the object hierarchy: My_Objects.Form.Set_Parent (My_Objects.Top_Ptr); My_Objects.Label.Set_Parent (My_Objects.Form_Ptr); My_Objects.Row_Column_Layout.Set_Parent (My_Objects.Form_Ptr); My_Objects.Ok.Set_Parent (My_Objects.Row_Column_Layout_Ptr); My_Objects.Cancel.Set_Parent (My_Objects.Row_Column_Layout_Ptr); -- Set the label text: My_Objects.Label.Label_Text.Set(Ada.Strings.Unbounded.To_Unbounded_String("Hello, World!")); -- Print the label text for kicks: Ada.Strings.Unbounded.Text_Io.Put_Line (My_Objects.Label.Label_Text.Get); -- Dump the widget hierarchy: Dump_Object_Tree(My_Objects.Top_Ptr); end Object_Hierarchy;

36.755102

95

0.721821

a00fb35bf931ae5ab53804c5a067294c4b3cb2d6

12,921

adb

Ada

dcf/src/dcf-zip-create.adb

onox/dcf-ada

47891e7789d3aa53d8f6632284cdf63dbd2ec7dd

[ "MIT" ]

5

2019-05-31T00:00:15.000Z

2022-02-11T23:11:54.000Z

dcf/src/dcf-zip-create.adb

onox/dcf-ada

47891e7789d3aa53d8f6632284cdf63dbd2ec7dd

[ "MIT" ]

null

dcf/src/dcf-zip-create.adb

onox/dcf-ada

47891e7789d3aa53d8f6632284cdf63dbd2ec7dd

[ "MIT" ]

null

-- SPDX-License-Identifier: MIT -- -- Copyright (c) 2000 - 2018 Gautier de Montmollin (maintainer) -- SWITZERLAND -- -- 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. with Ada.Unchecked_Deallocation; package body DCF.Zip.Create is Four_GB : constant := 4 * 1024 ** 3; Zip_32_Exceeded_Message : constant String := "Zip file larger than 4 GB limit of Zip_32 archive format"; procedure Create (Info : in out Zip_Create_Info; Stream : not null Zipstream_Class_Access; Compress : Zip.Compress.Compression_Method := Zip.Compress.Deflate_1) is begin Info.Stream := Stream; Info.Compress := Compress; end Create; function Is_Created (Info : Zip_Create_Info) return Boolean is (Info.Stream /= null); procedure Set (Info : in out Zip_Create_Info; New_Method : Zip.Compress.Compression_Method) is begin Info.Compress := New_Method; end Set; procedure Set_Comment (Info : in out Zip_Create_Info; Comment : String) is begin Info.Comment := SU.To_Unbounded_String (Comment); end Set_Comment; function Name (Info : Zip_Create_Info) return String is (Get_Name (Info.Stream.all)); procedure Dispose is new Ada.Unchecked_Deallocation (Dir_Entries, Pdir_Entries); procedure Resize (A : in out Pdir_Entries; Size : Integer) is Hlp : constant Pdir_Entries := new Dir_Entries (1 .. Size); begin if A = null then A := Hlp; else Hlp (1 .. Integer'Min (Size, A'Length)) := A (1 .. Integer'Min (Size, A'Length)); Dispose (A); A := Hlp; end if; end Resize; -- Internal - add the catalogue entry corresponding to a -- compressed file in the Zip archive. -- The entire catalogue will be written at the end of the zip stream, -- and the entry as a local header just before the compressed data. -- The entry's is mostly incomplete in the end (name, size, ...); stream -- operations on the archive being built are not performed here, -- see Add_Stream for that. procedure Add_Catalogue_Entry (Info : in out Zip_Create_Info) is begin if Info.Last_Entry = 0 then Info.Last_Entry := 1; Resize (Info.Contains, 32); else Info.Last_Entry := Info.Last_Entry + 1; if Info.Last_Entry > Info.Contains'Last then -- Info.Contains is full, time to resize it! -- We do nothing less than double the size - better than -- whatever offer you'd get in your e-mails. Resize (Info.Contains, Info.Contains'Last * 2); end if; end if; declare Cfh : Central_File_Header renames Info.Contains (Info.Last_Entry).Head; begin -- Administration Cfh.Made_By_Version := 20; -- Version 2.0 Cfh.Comment_Length := 0; Cfh.Disk_Number_Start := 0; Cfh.Internal_Attributes := 0; -- 0: binary; 1: text Cfh.External_Attributes := 0; Cfh.Short_Info.Needed_Extract_Version := 10; -- Value put by Zip/PKZip Cfh.Short_Info.Bit_Flag := 0; end; end Add_Catalogue_Entry; -- This is just for detecting duplicates procedure Insert_To_Name_Dictionary (File_Name : String; M : in out Name_Mapping.Map) is Cm : Name_Mapping.Cursor; Ok : Boolean; begin M.Insert (SU.To_Unbounded_String (File_Name), Cm, Ok); if not Ok then -- Name already registered raise Duplicate_Name with "Entry name '" & File_Name & "' already in archive"; end if; end Insert_To_Name_Dictionary; procedure Add_Stream (Info : in out Zip_Create_Info; Stream : in out Root_Zipstream_Type'Class; Feedback : in Feedback_Proc; Compressed_Size : out Zip.File_Size_Type; Final_Method : out Natural) is function To_File_Name (Path : String) return String is Name : String := Path; begin -- Appnote: 4.4.17.1, slashes must be forward slashes '/' instead of '\' for C of Name loop if C = '\' then C := '/'; end if; end loop; return Name; end To_File_Name; Mem1, Mem2 : Zs_Index_Type := Zs_Index_Type'First; Last : Positive; Entry_Name : constant String := To_File_Name (Get_Name (Stream)); Is_Folder : constant Boolean := Entry_Name (Entry_Name'Last) = '/'; begin if Is_Folder and then Stream.Size > 0 then raise Constraint_Error; end if; -- Check for duplicates; raises Duplicate_name in this case Insert_To_Name_Dictionary (Entry_Name, Info.Dir); Add_Catalogue_Entry (Info); Last := Info.Last_Entry; declare Cfh : Central_File_Header renames Info.Contains (Last).Head; Shi : Local_File_Header renames Cfh.Short_Info; begin pragma Assert (Zip.Headers.Encryption_Flag_Bit not in Shi.Bit_Flag); if Stream.UTF_8_Encoding then Shi.Bit_Flag := Shi.Bit_Flag or Zip.Headers.Language_Encoding_Flag_Bit; end if; Shi.File_Timedate := Get_Time (Stream); Shi.Dd.Uncompressed_Size := Unsigned_32 (Size (Stream)); Shi.Filename_Length := Entry_Name'Length; Info.Contains (Last).Name := new String'(Entry_Name); Shi.Extra_Field_Length := 0; Mem1 := Index (Info.Stream.all); Cfh.Local_Header_Offset := Unsigned_32 (Mem1) - 1; -- Write the local header with incomplete informations Zip.Headers.Write (Info.Stream.all, Shi); String'Write (Info.Stream, Entry_Name); -- Write compressed file Zip.Compress.Compress_Data (Input => Stream, Output => Info.Stream.all, Input_Size => Shi.Dd.Uncompressed_Size, Method => (if Is_Folder then Zip.Compress.Store else Info.Compress), Feedback => Feedback, CRC => Shi.Dd.Crc_32, Output_Size => Shi.Dd.Compressed_Size, Zip_Type => Shi.Zip_Type); Mem2 := Index (Info.Stream.all); if Info.Zip_Archive_Format = Zip_32 and then Mem2 > Four_GB then raise Zip_Capacity_Exceeded with Zip_32_Exceeded_Message; end if; -- Go back to the local header to rewrite it with complete informations -- known after the compression: CRC value, compressed size, actual compression format. Set_Index (Info.Stream.all, Mem1); Zip.Headers.Write (Info.Stream.all, Shi); -- Return to momentaneous end of file Set_Index (Info.Stream.all, Mem2); Compressed_Size := Shi.Dd.Compressed_Size; Final_Method := Natural (Shi.Zip_Type); end; end Add_Stream; procedure Add_Stream (Info : in out Zip_Create_Info; Stream : in out Root_Zipstream_Type'Class) is Compressed_Size : Zip.File_Size_Type; -- Dummy Final_Method : Natural; -- Dummy begin Add_Stream (Info, Stream, null, Compressed_Size, Final_Method); end Add_Stream; procedure Add_Compressed_Stream (Info : in out Zip_Create_Info; -- Destination Stream : in out Root_Zipstream_Type'Class; -- Source Feedback : in Feedback_Proc) is Lh : Zip.Headers.Local_File_Header; Data_Descriptor_After_Data : Boolean; begin Zip.Headers.Read_And_Check (Stream, Lh); Data_Descriptor_After_Data := (Lh.Bit_Flag and 8) /= 0; -- Copy name and ignore extra field declare Name : String (1 .. Positive (Lh.Filename_Length)); Extra : String (1 .. Natural (Lh.Extra_Field_Length)); begin String'Read (Stream'Access, Name); String'Read (Stream'Access, Extra); -- Check for duplicates; raises Duplicate_name in this case: Insert_To_Name_Dictionary (Name, Info.Dir); Add_Catalogue_Entry (Info); Info.Contains (Info.Last_Entry).Head.Local_Header_Offset := Unsigned_32 (Index (Info.Stream.all)) - 1; Info.Contains (Info.Last_Entry).Name := new String'(Name); Lh.Extra_Field_Length := 0; -- Extra field is zeroed (causes problems if not) Zip.Headers.Write (Info.Stream.all, Lh); -- Copy local header to new stream String'Write (Info.Stream, Name); -- Copy entry name to new stream end; Zip.Copy_Chunk (Stream, Info.Stream.all, Ada.Streams.Stream_Element_Count (Lh.Dd.Compressed_Size), Feedback => Feedback); -- Postfixed data descriptor contains the correct values for -- CRC and sizes. Example of Zip files using that descriptor: those -- created by Microsoft's OneDrive cloud storage (for downloading -- more than one file), in 2018. if Data_Descriptor_After_Data then -- NB: some faulty JAR files may fail with Read_and_check. -- See UnZip.Decompress, Process_descriptor. Zip.Headers.Read_And_Check (Stream, Lh.Dd); -- lh's values have been corrected on the way. Zip.Headers.Write (Info.Stream.all, Lh.Dd); -- Copy descriptor to new stream. end if; Info.Contains (Info.Last_Entry).Head.Short_Info := Lh; end Add_Compressed_Stream; procedure Finish (Info : in out Zip_Create_Info) is procedure Dispose is new Ada.Unchecked_Deallocation (String, P_String); Ed : Zip.Headers.End_Of_Central_Dir; Current_Index : Zs_Index_Type; procedure Get_Index_And_Check_Zip_32_Limit is begin Current_Index := Index (Info.Stream.all); if Info.Zip_Archive_Format = Zip_32 and then Current_Index > Four_GB then raise Zip_Capacity_Exceeded with Zip_32_Exceeded_Message; end if; end Get_Index_And_Check_Zip_32_Limit; begin -- 2/ Almost done - write Central Directory Get_Index_And_Check_Zip_32_Limit; Ed.Central_Dir_Offset := Unsigned_32 (Current_Index) - 1; Ed.Total_Entries := 0; Ed.Central_Dir_Size := 0; Ed.Main_Comment_Length := Unsigned_16 (SU.Length (Info.Comment)); if Info.Zip_Archive_Format = Zip_32 and then Info.Last_Entry > Integer (Unsigned_16'Last) then raise Zip_Capacity_Exceeded with "Too many entries (for Zip_32 archive format): more than 65535."; end if; if Info.Contains /= null then for E in 1 .. Info.Last_Entry loop Ed.Total_Entries := Ed.Total_Entries + 1; Zip.Headers.Write (Info.Stream.all, Info.Contains (E).Head); String'Write (Info.Stream, Info.Contains (E).Name.all); -- The extra field here is assumed to be empty! Ed.Central_Dir_Size := Ed.Central_Dir_Size + Zip.Headers.Central_Header_Length + Unsigned_32 (Info.Contains (E).Head.Short_Info.Filename_Length); Dispose (Info.Contains (E).Name); Get_Index_And_Check_Zip_32_Limit; end loop; Dispose (Info.Contains); end if; Info.Last_Entry := 0; Ed.Disknum := 0; Ed.Disknum_With_Start := 0; Ed.Disk_Total_Entries := Ed.Total_Entries; Zip.Headers.Write (Info.Stream.all, Ed); if Ed.Main_Comment_Length > 0 then String'Write (Info.Stream, SU.To_String (Info.Comment)); end if; Get_Index_And_Check_Zip_32_Limit; -- File will be closed automatically when stream goes out of scope Info.Stream := null; end Finish; end DCF.Zip.Create;

39.634969

97

0.630679

9a1d2113dd30a87195fb9e3c436d3ecb558edde6

694,423

adb

Ada

Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/bp_f1244.sched.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

null

Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/bp_f1244.sched.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

null

Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/bp_f1244.sched.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

1

2018-11-13T17:59:49.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>bp_f1244</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>feInput_V_data_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>feInput.V.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>feInput_V_user_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>feInput.V.user.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>112</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>feInput_V_keep_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>feInput.V.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>feInput_V_last_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>feInput.V.last.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>flushAck_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>flushAck_V_out</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_7"> <Value> <Obj> <type>1</type> <id>16</id> <name>metadataBuffer_rp_V_s</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_8"> <Value> <Obj> <type>1</type> <id>17</id> <name>valueBuffer_rp_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_9"> <Value> <Obj> <type>1</type> <id>19</id> <name>keyBuffer_rp_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>310</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_10"> <Value> <Obj> <type>0</type> <id>122</id> <name>flushAck_V_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>529</item> <item>530</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>150</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>532</item> <item>533</item> <item>534</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>163</id> <name>lastValueWord_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>535</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>164</id> <name>bpf_wordCounter_load</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>536</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>165</id> <name>p_Val2_35</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>537</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>166</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>538</item> <item>539</item> <item>540</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>168</id> <name>tmp</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>542</item> <item>543</item> <item>544</item> <item>545</item> <item>546</item> <item>548</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>169</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>549</item> <item>550</item> <item>551</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>171</id> <name>empty</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>185</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>553</item> <item>554</item> <item>555</item> <item>556</item> <item>557</item> <item>4159</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>172</id> <name>tmp_data_V</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>558</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>173</id> <name>tmp_user_V</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.user.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>112</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>559</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>174</id> <name>tmp_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>560</item> <item>562</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>175</id> <name>p_Val2_29</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>563</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>176</id> <name>bpf_keyLength_V_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>76</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>76</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>564</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>177</id> <name>keyLengthBuffer_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName>i_op</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>565</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>178</id> <name>bpf_opCode_V_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>566</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>179</id> <name>protocol_V_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>72</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>72</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>567</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>180</id> <name>tmp_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>568</item> <item>570</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>181</id> <name>tmp_36_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>571</item> <item>573</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>182</id> <name>tmp_37_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>574</item> <item>575</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>183</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>576</item> <item>577</item> <item>578</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>185</id> <name>tmp_241_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>617</item> <item>618</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>186</id> <name>bpf_valueLengthBuffe_1</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>95</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>95</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>619</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>187</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>620</item> <item>621</item> <item>622</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>189</id> <name>tmp_245_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>80</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>80</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>693</item> <item>694</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>190</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>80</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>80</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>695</item> <item>696</item> <item>697</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>192</id> <name>tmp_247_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>93</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>93</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>747</item> <item>748</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>193</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>93</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>93</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>749</item> <item>750</item> <item>751</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>195</id> <name>tmp_250_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>101</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>101</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>775</item> <item>776</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>196</id> <name>valueShift_load</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>777</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>197</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>101</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>101</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>778</item> <item>779</item> <item>780</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>199</id> <name>tmp_254_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>122</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>122</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>835</item> <item>836</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>200</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>122</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>122</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>837</item> <item>838</item> <item>839</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>202</id> <name>tmp_259_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>145</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1044</item> <item>1045</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>203</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>145</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1046</item> <item>1047</item> <item>1048</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>205</id> <name>Lo_assign_16_cast11_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1049</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>206</id> <name>tmp_71_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1050</item> <item>1051</item> <item>1052</item> <item>1053</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>207</id> <name>tmp_267_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1054</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>208</id> <name>op2_assign_1_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName>op2</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1056</item> <item>1057</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.09</m_delay> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>209</id> <name>op2_assign_1_cast_i_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1058</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>210</id> <name>tmp_268_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1059</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>211</id> <name>tmp_269_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1060</item> <item>1061</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>212</id> <name>tmp_523</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1062</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>213</id> <name>tmp_524</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1063</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>214</id> <name>tmp_525</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1064</item> <item>1065</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>215</id> <name>p_Result_64</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1066</item> <item>1067</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>216</id> <name>tmp_527</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1069</item> <item>1070</item> <item>1071</item> <item>1072</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>217</id> <name>tmp_528</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>26</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1073</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>218</id> <name>icmp4</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1074</item> <item>1075</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>219</id> <name>tmp_529</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1076</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>220</id> <name>tmp_530</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1077</item> <item>1078</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>221</id> <name>tmp_531</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1079</item> <item>1080</item> <item>1081</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>222</id> <name>tmp_532</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1082</item> <item>1083</item> <item>1084</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>223</id> <name>p_op</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1085</item> <item>1086</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>224</id> <name>tmp_533</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1087</item> <item>1088</item> <item>1090</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>225</id> <name>tmp_534</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1091</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>226</id> <name>tmp_535</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1092</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>227</id> <name>tmp_536</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1093</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>228</id> <name>tmp_537</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1094</item> <item>1095</item> </oprand_edges> <opcode>shl</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.35</m_delay> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>229</id> <name>tmp_538</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1096</item> <item>1097</item> <item>1098</item> <item>1099</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>230</id> <name>tmp_539</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1100</item> <item>1101</item> <item>1102</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>231</id> <name>tmp_540</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1103</item> <item>1104</item> </oprand_edges> <opcode>shl</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>232</id> <name>tmp_541</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1105</item> <item>1106</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>233</id> <name>p_demorgan</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1107</item> <item>1108</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>234</id> <name>tmp_542</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1109</item> <item>1110</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>235</id> <name>tmp_543</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1111</item> <item>1112</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>236</id> <name>tmp_544</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1113</item> <item>1114</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>237</id> <name>p_Result_65</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1115</item> <item>1116</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.62</m_delay> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>238</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>155</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>155</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1117</item> <item>1118</item> <item>1119</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>239</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>146</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1120</item> <item>1121</item> <item>1122</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>241</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1123</item> <item>1124</item> <item>4155</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>242</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1125</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>244</id> <name>tmp_275_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1126</item> <item>1127</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>245</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1128</item> <item>1129</item> <item>1130</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>247</id> <name>tmp_595</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>157</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1131</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>248</id> <name>tmp_278_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>157</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1132</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>249</id> <name>valueTemp</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>157</second> </item> </second> </item> </inlineStackInfo> <originalName>valueTemp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1133</item> <item>1134</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.30</m_delay> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>250</id> <name>tmp_596</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1135</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>251</id> <name>Lo_assign_10_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>Lo</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1136</item> <item>1137</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>252</id> <name>tmp_597</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1138</item> <item>1139</item> <item>1140</item> <item>1141</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>253</id> <name>tmp_598</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>26</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1142</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>254</id> <name>icmp8</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1143</item> <item>1144</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.67</m_delay> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>255</id> <name>tmp_599</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1145</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>256</id> <name>tmp_600</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1146</item> <item>1147</item> <item>1148</item> <item>1149</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>257</id> <name>tmp_601</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1150</item> <item>1151</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>258</id> <name>tmp_602</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1152</item> <item>1153</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>259</id> <name>tmp_603</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1154</item> <item>1155</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>260</id> <name>tmp_604</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1156</item> <item>1157</item> <item>1158</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>261</id> <name>tmp_605</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1159</item> <item>1160</item> <item>1161</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>262</id> <name>tmp_606</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1162</item> <item>1163</item> <item>1164</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>263</id> <name>tmp_607</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1165</item> <item>1166</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>264</id> <name>tmp_608</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1167</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>265</id> <name>tmp_609</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1168</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>266</id> <name>tmp_610</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1169</item> <item>1170</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.35</m_delay> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>267</id> <name>tmp_611</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1171</item> <item>1172</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>268</id> <name>p_Result_66</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1173</item> <item>1174</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>269</id> <name>tmp_613</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1175</item> <item>1176</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>270</id> <name>tmp_614</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1177</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>271</id> <name>tmp_615</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1178</item> <item>1179</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>272</id> <name>tmp_616</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1180</item> <item>1181</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>273</id> <name>tmp_617</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1182</item> <item>1183</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>274</id> <name>tmp_618</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1184</item> <item>1185</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>275</id> <name>p_Result_55</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1186</item> <item>1187</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>276</id> <name>tmp_279_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1188</item> <item>1190</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_114"> <Value> <Obj> <type>0</type> <id>277</id> <name>tmp_280_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1191</item> <item>1192</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_115"> <Value> <Obj> <type>0</type> <id>278</id> <name>or_cond_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1193</item> <item>1194</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_116"> <Value> <Obj> <type>0</type> <id>279</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1195</item> <item>1196</item> <item>1197</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_117"> <Value> <Obj> <type>0</type> <id>281</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>160</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>160</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1199</item> <item>1200</item> <item>4158</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_118"> <Value> <Obj> <type>0</type> <id>282</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>161</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1201</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_119"> <Value> <Obj> <type>0</type> <id>284</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>162</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>162</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1202</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_120"> <Value> <Obj> <type>0</type> <id>286</id> <name>valueTempBuffer_V_ne_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1203</item> <item>1204</item> <item>1205</item> <item>1206</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_121"> <Value> <Obj> <type>0</type> <id>287</id> <name>tmp_282_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1207</item> <item>1209</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_122"> <Value> <Obj> <type>0</type> <id>288</id> <name>tmp_283_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1210</item> <item>1211</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.32</m_delay> </item> <item class_id_reference="9" object_id="_123"> <Value> <Obj> <type>0</type> <id>289</id> <name>tmp_419_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1212</item> <item>1213</item> <item>1214</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.53</m_delay> </item> <item class_id_reference="9" object_id="_124"> <Value> <Obj> <type>0</type> <id>290</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1215</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_125"> <Value> <Obj> <type>0</type> <id>292</id> <name>valueTempBuffer_V_ne_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1216</item> <item>1217</item> <item>1218</item> <item>1219</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_126"> <Value> <Obj> <type>0</type> <id>293</id> <name>storemerge1_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1220</item> <item>1221</item> <item>1222</item> <item>1223</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_127"> <Value> <Obj> <type>0</type> <id>294</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>163</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>163</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1224</item> <item>1225</item> <item>4172</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_128"> <Value> <Obj> <type>0</type> <id>295</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>165</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>165</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1226</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_129"> <Value> <Obj> <type>0</type> <id>297</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>123</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>123</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>840</item> <item>841</item> <item>842</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_130"> <Value> <Obj> <type>0</type> <id>298</id> <name>tmp_258_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>124</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>124</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>843</item> <item>844</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_131"> <Value> <Obj> <type>0</type> <id>299</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>124</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>124</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>845</item> <item>846</item> <item>847</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_132"> <Value> <Obj> <type>0</type> <id>301</id> <name>tmp_520</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1029</item> <item>1030</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_133"> <Value> <Obj> <type>0</type> <id>302</id> <name>tmp_521</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1031</item> <item>1032</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_134"> <Value> <Obj> <type>0</type> <id>303</id> <name>tmp_522</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1033</item> <item>1034</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_135"> <Value> <Obj> <type>0</type> <id>304</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1035</item> <item>1036</item> <item>1037</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_136"> <Value> <Obj> <type>0</type> <id>306</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>141</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>141</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1038</item> <item>1039</item> <item>4167</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_137"> <Value> <Obj> <type>0</type> <id>307</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>142</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>142</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1040</item> <item>1041</item> <item>4154</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_138"> <Value> <Obj> <type>0</type> <id>308</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>143</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1042</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_139"> <Value> <Obj> <type>0</type> <id>310</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1043</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_140"> <Value> <Obj> <type>0</type> <id>312</id> <name>tmp_518</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>848</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_141"> <Value> <Obj> <type>0</type> <id>313</id> <name>tmp_261_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>850</item> <item>851</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.09</m_delay> </item> <item class_id_reference="9" object_id="_142"> <Value> <Obj> <type>0</type> <id>314</id> <name>tmp_519</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>852</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_143"> <Value> <Obj> <type>0</type> <id>315</id> <name>tmp_263_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>854</item> <item>855</item> <item>857</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_144"> <Value> <Obj> <type>0</type> <id>316</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>858</item> <item>859</item> <item>4174</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_145"> <Value> <Obj> <type>0</type> <id>317</id> <name>tmp_264_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>860</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_146"> <Value> <Obj> <type>0</type> <id>318</id> <name>op2_assign_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName>op2</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>862</item> <item>863</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_147"> <Value> <Obj> <type>0</type> <id>319</id> <name>op2_assign_cast_i_i_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>864</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_148"> <Value> <Obj> <type>0</type> <id>320</id> <name>tmp_265_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>865</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_149"> <Value> <Obj> <type>0</type> <id>321</id> <name>tmp_266_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>866</item> <item>867</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_150"> <Value> <Obj> <type>0</type> <id>322</id> <name>p_0283_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>868</item> <item>870</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_151"> <Value> <Obj> <type>0</type> <id>323</id> <name>p_0283_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>871</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_152"> <Value> <Obj> <type>0</type> <id>324</id> <name>tmp_273_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>872</item> <item>873</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.32</m_delay> </item> <item class_id_reference="9" object_id="_153"> <Value> <Obj> <type>0</type> <id>325</id> <name>storemerge27_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>874</item> <item>875</item> <item>877</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.53</m_delay> </item> <item class_id_reference="9" object_id="_154"> <Value> <Obj> <type>0</type> <id>326</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>878</item> <item>879</item> <item>4171</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_155"> <Value> <Obj> <type>0</type> <id>327</id> <name>tmp_274_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>127</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>880</item> <item>881</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_156"> <Value> <Obj> <type>0</type> <id>328</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>127</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>882</item> <item>883</item> <item>884</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_157"> <Value> <Obj> <type>0</type> <id>330</id> <name>tmp_276_cast_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>885</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_158"> <Value> <Obj> <type>0</type> <id>331</id> <name>tmp_571</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>887</item> <item>888</item> <item>889</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_159"> <Value> <Obj> <type>0</type> <id>332</id> <name>Lo_assign_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName>Lo</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>891</item> <item>892</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_160"> <Value> <Obj> <type>0</type> <id>333</id> <name>tmp_572</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>894</item> <item>895</item> <item>897</item> <item>898</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_161"> <Value> <Obj> <type>0</type> <id>334</id> <name>tmp_573</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>26</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>899</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_162"> <Value> <Obj> <type>0</type> <id>335</id> <name>icmp7</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>900</item> <item>902</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.67</m_delay> </item> <item class_id_reference="9" object_id="_163"> <Value> <Obj> <type>0</type> <id>336</id> <name>tmp_574</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>903</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_164"> <Value> <Obj> <type>0</type> <id>337</id> <name>tmp_575</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>905</item> <item>906</item> <item>908</item> <item>909</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_165"> <Value> <Obj> <type>0</type> <id>338</id> <name>tmp_576</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>911</item> <item>912</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_166"> <Value> <Obj> <type>0</type> <id>339</id> <name>tmp_577</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>914</item> <item>915</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_167"> <Value> <Obj> <type>0</type> <id>340</id> <name>tmp_578</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>916</item> <item>917</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_168"> <Value> <Obj> <type>0</type> <id>341</id> <name>tmp_579</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>918</item> <item>919</item> <item>920</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_169"> <Value> <Obj> <type>0</type> <id>342</id> <name>tmp_580</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>921</item> <item>922</item> <item>923</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_170"> <Value> <Obj> <type>0</type> <id>343</id> <name>tmp_581</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>924</item> <item>925</item> <item>926</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_171"> <Value> <Obj> <type>0</type> <id>344</id> <name>tmp_582</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>927</item> <item>928</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_172"> <Value> <Obj> <type>0</type> <id>345</id> <name>tmp_583</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>929</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_173"> <Value> <Obj> <type>0</type> <id>346</id> <name>tmp_584</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>930</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_174"> <Value> <Obj> <type>0</type> <id>347</id> <name>tmp_585</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>931</item> <item>932</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.35</m_delay> </item> <item class_id_reference="9" object_id="_175"> <Value> <Obj> <type>0</type> <id>348</id> <name>tmp_586</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>934</item> <item>935</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_176"> <Value> <Obj> <type>0</type> <id>349</id> <name>p_Result_61</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>936</item> <item>937</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_177"> <Value> <Obj> <type>0</type> <id>350</id> <name>tmp_588</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>939</item> <item>940</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_178"> <Value> <Obj> <type>0</type> <id>351</id> <name>tmp_589</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>941</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_179"> <Value> <Obj> <type>0</type> <id>352</id> <name>tmp_590</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>942</item> <item>943</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_180"> <Value> <Obj> <type>0</type> <id>353</id> <name>tmp_591</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>944</item> <item>945</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_181"> <Value> <Obj> <type>0</type> <id>354</id> <name>tmp_592</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>946</item> <item>947</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_182"> <Value> <Obj> <type>0</type> <id>355</id> <name>tmp_593</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>948</item> <item>949</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_183"> <Value> <Obj> <type>0</type> <id>356</id> <name>p_Result_49</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>950</item> <item>951</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_184"> <Value> <Obj> <type>0</type> <id>357</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>131</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>131</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>952</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_185"> <Value> <Obj> <type>0</type> <id>359</id> <name>tmp_547</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>953</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_186"> <Value> <Obj> <type>0</type> <id>360</id> <name>tmp_548</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>954</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_187"> <Value> <Obj> <type>0</type> <id>361</id> <name>Lo_assign_15_cast_i_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>955</item> <item>956</item> <item>957</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_188"> <Value> <Obj> <type>0</type> <id>362</id> <name>tmp_549</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>958</item> <item>959</item> <item>960</item> <item>961</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_189"> <Value> <Obj> <type>0</type> <id>363</id> <name>tmp_550</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>26</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>962</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_190"> <Value> <Obj> <type>0</type> <id>364</id> <name>icmp5</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>963</item> <item>964</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_191"> <Value> <Obj> <type>0</type> <id>365</id> <name>tmp_551</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>965</item> <item>966</item> <item>967</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_192"> <Value> <Obj> <type>0</type> <id>366</id> <name>tmp_552</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>968</item> <item>969</item> <item>970</item> <item>971</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_193"> <Value> <Obj> <type>0</type> <id>367</id> <name>tmp_553</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>972</item> <item>973</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_194"> <Value> <Obj> <type>0</type> <id>368</id> <name>tmp_554</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>974</item> <item>975</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_195"> <Value> <Obj> <type>0</type> <id>369</id> <name>tmp_555</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>976</item> <item>977</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_196"> <Value> <Obj> <type>0</type> <id>370</id> <name>tmp_556</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>978</item> <item>979</item> <item>980</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_197"> <Value> <Obj> <type>0</type> <id>371</id> <name>tmp_557</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>981</item> <item>982</item> <item>983</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_198"> <Value> <Obj> <type>0</type> <id>372</id> <name>tmp_558</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>984</item> <item>985</item> <item>986</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_199"> <Value> <Obj> <type>0</type> <id>373</id> <name>tmp_559</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>987</item> <item>988</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_200"> <Value> <Obj> <type>0</type> <id>374</id> <name>tmp_560</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>989</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_201"> <Value> <Obj> <type>0</type> <id>375</id> <name>tmp_561</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>990</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_202"> <Value> <Obj> <type>0</type> <id>376</id> <name>tmp_562</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>991</item> <item>992</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.35</m_delay> </item> <item class_id_reference="9" object_id="_203"> <Value> <Obj> <type>0</type> <id>377</id> <name>tmp_563</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>993</item> <item>994</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_204"> <Value> <Obj> <type>0</type> <id>378</id> <name>p_Result_62</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>995</item> <item>996</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_205"> <Value> <Obj> <type>0</type> <id>379</id> <name>tmp_565</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>997</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_206"> <Value> <Obj> <type>0</type> <id>380</id> <name>tmp_566</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>998</item> <item>999</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_207"> <Value> <Obj> <type>0</type> <id>381</id> <name>tmp_567</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1000</item> <item>1001</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_208"> <Value> <Obj> <type>0</type> <id>382</id> <name>tmp_568</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1002</item> <item>1003</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_209"> <Value> <Obj> <type>0</type> <id>383</id> <name>tmp_569</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1004</item> <item>1005</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_210"> <Value> <Obj> <type>0</type> <id>384</id> <name>p_Result_63</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1006</item> <item>1007</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_211"> <Value> <Obj> <type>0</type> <id>385</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1008</item> <item>1009</item> <item>1010</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_212"> <Value> <Obj> <type>0</type> <id>386</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1011</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_213"> <Value> <Obj> <type>0</type> <id>388</id> <name>valueTempBuffer_V_ne</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1012</item> <item>1013</item> <item>1014</item> <item>1015</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_214"> <Value> <Obj> <type>0</type> <id>389</id> <name>storemerge28_i_i_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1017</item> <item>1018</item> <item>1020</item> <item>1021</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_215"> <Value> <Obj> <type>0</type> <id>390</id> <name>storemerge28_cast22_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>136</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1022</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_216"> <Value> <Obj> <type>0</type> <id>391</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>136</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1023</item> <item>1024</item> <item>4168</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_217"> <Value> <Obj> <type>0</type> <id>392</id> <name>storemerge28_cast_ca</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>130</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>130</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1025</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_218"> <Value> <Obj> <type>0</type> <id>393</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>130</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>130</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1026</item> <item>1027</item> <item>4157</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_219"> <Value> <Obj> <type>0</type> <id>394</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>139</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>139</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1028</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_220"> <Value> <Obj> <type>0</type> <id>396</id> <name>valueTempBuffer_V_fl</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>8</count> <item_version>0</item_version> <item>1227</item> <item>1228</item> <item>1230</item> <item>1231</item> <item>1232</item> <item>1233</item> <item>1234</item> <item>1235</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_221"> <Value> <Obj> <type>0</type> <id>397</id> <name>valueTempBuffer_V_ne_3</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>133</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>133</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>8</count> <item_version>0</item_version> <item>1236</item> <item>1237</item> <item>1239</item> <item>1240</item> <item>1241</item> <item>1242</item> <item>1243</item> <item>1244</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_222"> <Value> <Obj> <type>0</type> <id>398</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1245</item> <item>1246</item> <item>1247</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_223"> <Value> <Obj> <type>0</type> <id>400</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>128</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1262</item> <item>1263</item> <item>4156</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_224"> <Value> <Obj> <type>0</type> <id>401</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1264</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_225"> <Value> <Obj> <type>0</type> <id>403</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1265</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_226"> <Value> <Obj> <type>0</type> <id>405</id> <name>tmp_253_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>102</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>102</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>781</item> <item>782</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_227"> <Value> <Obj> <type>0</type> <id>406</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>102</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>102</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>783</item> <item>784</item> <item>785</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_228"> <Value> <Obj> <type>0</type> <id>408</id> <name>tmp_516</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>110</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>110</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>795</item> <item>796</item> <item>797</item> <item>798</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_229"> <Value> <Obj> <type>0</type> <id>409</id> <name>icmp6</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>110</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>110</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>799</item> <item>800</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_230"> <Value> <Obj> <type>0</type> <id>410</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>110</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>110</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>801</item> <item>802</item> <item>803</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_231"> <Value> <Obj> <type>0</type> <id>412</id> <name>tmp_517</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>113</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>808</item> <item>809</item> <item>811</item> <item>812</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_232"> <Value> <Obj> <type>0</type> <id>413</id> <name>icmp9</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>113</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>813</item> <item>814</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_233"> <Value> <Obj> <type>0</type> <id>414</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>113</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>815</item> <item>816</item> <item>817</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_234"> <Value> <Obj> <type>0</type> <id>416</id> <name>tmp_546</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>115</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>115</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>818</item> <item>819</item> <item>820</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.58</m_delay> </item> <item class_id_reference="9" object_id="_235"> <Value> <Obj> <type>0</type> <id>417</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>115</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>115</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>821</item> <item>822</item> <item>4153</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_236"> <Value> <Obj> <type>0</type> <id>418</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>118</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>118</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>823</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_237"> <Value> <Obj> <type>0</type> <id>420</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>824</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_238"> <Value> <Obj> <type>0</type> <id>422</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>111</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>111</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>804</item> <item>805</item> <item>4152</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_239"> <Value> <Obj> <type>0</type> <id>423</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>112</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>112</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>806</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_240"> <Value> <Obj> <type>0</type> <id>425</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>825</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_241"> <Value> <Obj> <type>0</type> <id>427</id> <name>storemerge_cast_cast</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>104</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>104</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>786</item> <item>787</item> <item>789</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.58</m_delay> </item> <item class_id_reference="9" object_id="_242"> <Value> <Obj> <type>0</type> <id>428</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>104</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>104</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>790</item> <item>791</item> <item>4151</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_243"> <Value> <Obj> <type>0</type> <id>429</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>108</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>108</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>792</item> <item>793</item> <item>4173</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_244"> <Value> <Obj> <type>0</type> <id>430</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>109</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>109</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>794</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_245"> <Value> <Obj> <type>0</type> <id>432</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>119</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>119</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>826</item> <item>827</item> <item>828</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_246"> <Value> <Obj> <type>0</type> <id>433</id> <name>tmp_281_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>120</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>829</item> <item>831</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_247"> <Value> <Obj> <type>0</type> <id>434</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>120</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>832</item> <item>833</item> <item>4166</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_248"> <Value> <Obj> <type>0</type> <id>435</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>121</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>834</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_249"> <Value> <Obj> <type>0</type> <id>437</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1248</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_250"> <Value> <Obj> <type>0</type> <id>439</id> <name>tmp_511</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>752</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_251"> <Value> <Obj> <type>0</type> <id>440</id> <name>p_Result_60</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>753</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_252"> <Value> <Obj> <type>0</type> <id>441</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>755</item> <item>756</item> <item>757</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_253"> <Value> <Obj> <type>0</type> <id>442</id> <name>tmp_248_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>95</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>95</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>759</item> <item>760</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.32</m_delay> </item> <item class_id_reference="9" object_id="_254"> <Value> <Obj> <type>0</type> <id>443</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>95</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>95</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>761</item> <item>762</item> <item>4170</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_255"> <Value> <Obj> <type>0</type> <id>444</id> <name>tmp_512</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>763</item> <item>764</item> <item>765</item> <item>766</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_256"> <Value> <Obj> <type>0</type> <id>445</id> <name>icmp3</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>767</item> <item>768</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_257"> <Value> <Obj> <type>0</type> <id>446</id> <name>tmp_513</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>97</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>97</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>769</item> <item>770</item> <item>771</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.58</m_delay> </item> <item class_id_reference="9" object_id="_258"> <Value> <Obj> <type>0</type> <id>447</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>97</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>97</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>772</item> <item>773</item> <item>4148</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_259"> <Value> <Obj> <type>0</type> <id>448</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>100</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>100</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>774</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_260"> <Value> <Obj> <type>0</type> <id>450</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1249</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_261"> <Value> <Obj> <type>0</type> <id>452</id> <name>tmp_246_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>81</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>81</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>698</item> <item>700</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_262"> <Value> <Obj> <type>0</type> <id>453</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>81</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>81</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>701</item> <item>702</item> <item>703</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_263"> <Value> <Obj> <type>0</type> <id>455</id> <name>tmp_508</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>708</item> <item>709</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_264"> <Value> <Obj> <type>0</type> <id>456</id> <name>tmp_509</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>710</item> <item>711</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_265"> <Value> <Obj> <type>0</type> <id>457</id> <name>tmp_510</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>712</item> <item>713</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_266"> <Value> <Obj> <type>0</type> <id>458</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>714</item> <item>715</item> <item>716</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_267"> <Value> <Obj> <type>0</type> <id>460</id> <name>tmp_251_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>89</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>89</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>735</item> <item>737</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_268"> <Value> <Obj> <type>0</type> <id>461</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>89</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>89</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>738</item> <item>739</item> <item>740</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_269"> <Value> <Obj> <type>0</type> <id>463</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>90</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>90</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>741</item> <item>742</item> <item>4150</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_270"> <Value> <Obj> <type>0</type> <id>464</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>91</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>91</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>743</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_271"> <Value> <Obj> <type>0</type> <id>466</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>744</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_272"> <Value> <Obj> <type>0</type> <id>468</id> <name>tmp_514</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>84</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>84</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>718</item> <item>719</item> <item>721</item> <item>723</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_273"> <Value> <Obj> <type>0</type> <id>469</id> <name>icmp</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>84</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>84</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>724</item> <item>726</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_274"> <Value> <Obj> <type>0</type> <id>470</id> <name>tmp_515</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>85</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>85</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>727</item> <item>729</item> <item>731</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.58</m_delay> </item> <item class_id_reference="9" object_id="_275"> <Value> <Obj> <type>0</type> <id>471</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>85</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>85</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>732</item> <item>733</item> <item>4149</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_276"> <Value> <Obj> <type>0</type> <id>472</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>88</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>734</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_277"> <Value> <Obj> <type>0</type> <id>474</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>745</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_278"> <Value> <Obj> <type>0</type> <id>476</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>82</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>82</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>705</item> <item>706</item> <item>4147</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_279"> <Value> <Obj> <type>0</type> <id>477</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>82</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>82</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>707</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_280"> <Value> <Obj> <type>0</type> <id>479</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>92</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>92</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>746</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_281"> <Value> <Obj> <type>0</type> <id>481</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1250</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_282"> <Value> <Obj> <type>0</type> <id>483</id> <name>p_Result_i_i_i_i_i</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>623</item> <item>624</item> <item>625</item> <item>626</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_283"> <Value> <Obj> <type>0</type> <id>484</id> <name>p_Result_i_i_i_i_s</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>627</item> <item>628</item> <item>630</item> <item>632</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_284"> <Value> <Obj> <type>0</type> <id>485</id> <name>tmp_506</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>634</item> <item>635</item> <item>636</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_285"> <Value> <Obj> <type>0</type> <id>486</id> <name>tmp_242_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>638</item> <item>639</item> <item>640</item> <item>641</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_286"> <Value> <Obj> <type>0</type> <id>487</id> <name>tmp_243_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>642</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_287"> <Value> <Obj> <type>0</type> <id>488</id> <name>tmp_244_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>643</item> <item>644</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.32</m_delay> </item> <item class_id_reference="9" object_id="_288"> <Value> <Obj> <type>0</type> <id>489</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>645</item> <item>646</item> <item>4169</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_289"> <Value> <Obj> <type>0</type> <id>490</id> <name>p_Result_56</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>72</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>72</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>648</item> <item>649</item> <item>650</item> <item>652</item> <item>654</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_290"> <Value> <Obj> <type>0</type> <id>491</id> <name>p_Result_57</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>656</item> <item>657</item> <item>658</item> <item>660</item> <item>662</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_291"> <Value> <Obj> <type>0</type> <id>492</id> <name>tmp_507</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>663</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_292"> <Value> <Obj> <type>0</type> <id>493</id> <name>p_Result_58</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>665</item> <item>666</item> <item>667</item> <item>669</item> <item>671</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_293"> <Value> <Obj> <type>0</type> <id>494</id> <name>tmp_71_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>76</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>76</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>25</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>673</item> <item>674</item> <item>675</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_294"> <Value> <Obj> <type>0</type> <id>495</id> <name>p_Result_59</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>76</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>76</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>677</item> <item>678</item> <item>679</item> <item>681</item> <item>682</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_295"> <Value> <Obj> <type>0</type> <id>496</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>76</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>76</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>683</item> <item>684</item> <item>4165</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_296"> <Value> <Obj> <type>0</type> <id>497</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>77</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>77</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>686</item> <item>687</item> <item>688</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_297"> <Value> <Obj> <type>0</type> <id>498</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>78</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>78</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>690</item> <item>691</item> <item>4146</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_298"> <Value> <Obj> <type>0</type> <id>499</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>79</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>79</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>692</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_299"> <Value> <Obj> <type>0</type> <id>501</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1251</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_300"> <Value> <Obj> <type>0</type> <id>503</id> <name>tmp_504</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>108</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>579</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_301"> <Value> <Obj> <type>0</type> <id>504</id> <name>loc_V_trunc_i_i_i_i</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>124</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>580</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_302"> <Value> <Obj> <type>0</type> <id>505</id> <name>p_Result_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>582</item> <item>583</item> <item>584</item> <item>586</item> <item>588</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_303"> <Value> <Obj> <type>0</type> <id>506</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>589</item> <item>590</item> <item>4160</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_304"> <Value> <Obj> <type>0</type> <id>507</id> <name>p_Result_61_i_i_i_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>592</item> <item>593</item> <item>595</item> <item>597</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_305"> <Value> <Obj> <type>0</type> <id>508</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>598</item> <item>599</item> <item>4161</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_306"> <Value> <Obj> <type>0</type> <id>509</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>600</item> <item>601</item> <item>4162</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_307"> <Value> <Obj> <type>0</type> <id>510</id> <name>p_Result_62_i_i_i_s</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>602</item> <item>603</item> <item>605</item> <item>607</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_308"> <Value> <Obj> <type>0</type> <id>511</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>608</item> <item>609</item> <item>4163</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_309"> <Value> <Obj> <type>0</type> <id>512</id> <name>tmp_505</name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>64</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>64</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>610</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_310"> <Value> <Obj> <type>0</type> <id>513</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>64</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>64</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>611</item> <item>612</item> <item>4164</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_311"> <Value> <Obj> <type>0</type> <id>514</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>614</item> <item>615</item> <item>4145</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_312"> <Value> <Obj> <type>0</type> <id>515</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>616</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_313"> <Value> <Obj> <type>0</type> <id>517</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1252</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_314"> <Value> <Obj> <type>0</type> <id>519</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>168</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1253</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_315"> <Value> <Obj> <type>0</type> <id>521</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>170</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>170</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1254</item> <item>1255</item> <item>1256</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_316"> <Value> <Obj> <type>0</type> <id>522</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>171</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>171</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1257</item> <item>1258</item> <item>4143</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_317"> <Value> <Obj> <type>0</type> <id>523</id> <name></name> <fileName>sources/requestParser/requestParser.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>173</lineNumber> <contextFuncName>bp_f</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/requestParser/requestParser.cpp</first> <second>bp_f</second> </first> <second>173</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1259</item> <item>1260</item> <item>4144</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.22</m_delay> </item> <item class_id_reference="9" object_id="_318"> <Value> <Obj> <type>0</type> <id>524</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1261</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_319"> <Value> <Obj> <type>0</type> <id>526</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>55</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_320"> <Value> <Obj> <type>2</type> <id>547</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_321"> <Value> <Obj> <type>2</type> <id>561</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_322"> <Value> <Obj> <type>2</type> <id>569</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_323"> <Value> <Obj> <type>2</type> <id>572</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_324"> <Value> <Obj> <type>2</type> <id>585</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>124</content> </item> <item class_id_reference="16" object_id="_325"> <Value> <Obj> <type>2</type> <id>587</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>247</content> </item> <item class_id_reference="16" object_id="_326"> <Value> <Obj> <type>2</type> <id>594</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>24</content> </item> <item class_id_reference="16" object_id="_327"> <Value> <Obj> <type>2</type> <id>596</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_328"> <Value> <Obj> <type>2</type> <id>604</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_329"> <Value> <Obj> <type>2</type> <id>606</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>15</content> </item> <item class_id_reference="16" object_id="_330"> <Value> <Obj> <type>2</type> <id>613</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_331"> <Value> <Obj> <type>2</type> <id>629</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_332"> <Value> <Obj> <type>2</type> <id>631</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>23</content> </item> <item class_id_reference="16" object_id="_333"> <Value> <Obj> <type>2</type> <id>651</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>120</content> </item> <item class_id_reference="16" object_id="_334"> <Value> <Obj> <type>2</type> <id>653</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>123</content> </item> <item class_id_reference="16" object_id="_335"> <Value> <Obj> <type>2</type> <id>659</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>104</content> </item> <item class_id_reference="16" object_id="_336"> <Value> <Obj> <type>2</type> <id>661</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>111</content> </item> <item class_id_reference="16" object_id="_337"> <Value> <Obj> <type>2</type> <id>668</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>56</content> </item> <item class_id_reference="16" object_id="_338"> <Value> <Obj> <type>2</type> <id>670</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>85</content> </item> <item class_id_reference="16" object_id="_339"> <Value> <Obj> <type>2</type> <id>680</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_340"> <Value> <Obj> <type>2</type> <id>689</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_341"> <Value> <Obj> <type>2</type> <id>699</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_342"> <Value> <Obj> <type>2</type> <id>704</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> <item class_id_reference="16" object_id="_343"> <Value> <Obj> <type>2</type> <id>720</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> <item class_id_reference="16" object_id="_344"> <Value> <Obj> <type>2</type> <id>722</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>7</content> </item> <item class_id_reference="16" object_id="_345"> <Value> <Obj> <type>2</type> <id>725</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_346"> <Value> <Obj> <type>2</type> <id>728</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_347"> <Value> <Obj> <type>2</type> <id>730</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>5</content> </item> <item class_id_reference="16" object_id="_348"> <Value> <Obj> <type>2</type> <id>736</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_349"> <Value> <Obj> <type>2</type> <id>758</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <const_type>0</const_type> <content>131064</content> </item> <item class_id_reference="16" object_id="_350"> <Value> <Obj> <type>2</type> <id>788</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_351"> <Value> <Obj> <type>2</type> <id>810</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_352"> <Value> <Obj> <type>2</type> <id>830</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>248</content> </item> <item class_id_reference="16" object_id="_353"> <Value> <Obj> <type>2</type> <id>849</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_354"> <Value> <Obj> <type>2</type> <id>856</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_355"> <Value> <Obj> <type>2</type> <id>861</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_356"> <Value> <Obj> <type>2</type> <id>869</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <const_type>0</const_type> <content>504</content> </item> <item class_id_reference="16" object_id="_357"> <Value> <Obj> <type>2</type> <id>876</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_358"> <Value> <Obj> <type>2</type> <id>890</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <const_type>0</const_type> <content>64</content> </item> <item class_id_reference="16" object_id="_359"> <Value> <Obj> <type>2</type> <id>896</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_360"> <Value> <Obj> <type>2</type> <id>901</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>26</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_361"> <Value> <Obj> <type>2</type> <id>907</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_362"> <Value> <Obj> <type>2</type> <id>910</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>65</content> </item> <item class_id_reference="16" object_id="_363"> <Value> <Obj> <type>2</type> <id>913</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_364"> <Value> <Obj> <type>2</type> <id>933</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>18446744073709551615</content> </item> <item class_id_reference="16" object_id="_365"> <Value> <Obj> <type>2</type> <id>938</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>64</content> </item> <item class_id_reference="16" object_id="_366"> <Value> <Obj> <type>2</type> <id>1016</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_367"> <Value> <Obj> <type>2</type> <id>1019</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_368"> <Value> <Obj> <type>2</type> <id>1055</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_369"> <Value> <Obj> <type>2</type> <id>1089</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_370"> <Value> <Obj> <type>2</type> <id>1189</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_371"> <Value> <Obj> <type>2</type> <id>1198</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_372"> <Value> <Obj> <type>2</type> <id>1208</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_373"> <Value> <Obj> <type>2</type> <id>1229</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_374"> <Value> <Obj> <type>2</type> <id>1238</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>4</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>57</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_375"> <Obj> <type>3</type> <id>167</id> <name>entry</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>122</item> <item>150</item> <item>163</item> <item>164</item> <item>165</item> <item>166</item> </node_objs> </item> <item class_id_reference="18" object_id="_376"> <Obj> <type>3</type> <id>170</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>168</item> <item>169</item> </node_objs> </item> <item class_id_reference="18" object_id="_377"> <Obj> <type>3</type> <id>184</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>13</count> <item_version>0</item_version> <item>171</item> <item>172</item> <item>173</item> <item>174</item> <item>175</item> <item>176</item> <item>177</item> <item>178</item> <item>179</item> <item>180</item> <item>181</item> <item>182</item> <item>183</item> </node_objs> </item> <item class_id_reference="18" object_id="_378"> <Obj> <type>3</type> <id>188</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>185</item> <item>186</item> <item>187</item> </node_objs> </item> <item class_id_reference="18" object_id="_379"> <Obj> <type>3</type> <id>191</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>189</item> <item>190</item> </node_objs> </item> <item class_id_reference="18" object_id="_380"> <Obj> <type>3</type> <id>194</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>192</item> <item>193</item> </node_objs> </item> <item class_id_reference="18" object_id="_381"> <Obj> <type>3</type> <id>198</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>195</item> <item>196</item> <item>197</item> </node_objs> </item> <item class_id_reference="18" object_id="_382"> <Obj> <type>3</type> <id>201</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>199</item> <item>200</item> </node_objs> </item> <item class_id_reference="18" object_id="_383"> <Obj> <type>3</type> <id>204</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>202</item> <item>203</item> </node_objs> </item> <item class_id_reference="18" object_id="_384"> <Obj> <type>3</type> <id>240</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>35</count> <item_version>0</item_version> <item>205</item> <item>206</item> <item>207</item> <item>208</item> <item>209</item> <item>210</item> <item>211</item> <item>212</item> <item>213</item> <item>214</item> <item>215</item> <item>216</item> <item>217</item> <item>218</item> <item>219</item> <item>220</item> <item>221</item> <item>222</item> <item>223</item> <item>224</item> <item>225</item> <item>226</item> <item>227</item> <item>228</item> <item>229</item> <item>230</item> <item>231</item> <item>232</item> <item>233</item> <item>234</item> <item>235</item> <item>236</item> <item>237</item> <item>238</item> <item>239</item> </node_objs> </item> <item class_id_reference="18" object_id="_385"> <Obj> <type>3</type> <id>243</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>241</item> <item>242</item> </node_objs> </item> <item class_id_reference="18" object_id="_386"> <Obj> <type>3</type> <id>246</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>244</item> <item>245</item> </node_objs> </item> <item class_id_reference="18" object_id="_387"> <Obj> <type>3</type> <id>280</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>33</count> <item_version>0</item_version> <item>247</item> <item>248</item> <item>249</item> <item>250</item> <item>251</item> <item>252</item> <item>253</item> <item>254</item> <item>255</item> <item>256</item> <item>257</item> <item>258</item> <item>259</item> <item>260</item> <item>261</item> <item>262</item> <item>263</item> <item>264</item> <item>265</item> <item>266</item> <item>267</item> <item>268</item> <item>269</item> <item>270</item> <item>271</item> <item>272</item> <item>273</item> <item>274</item> <item>275</item> <item>276</item> <item>277</item> <item>278</item> <item>279</item> </node_objs> </item> <item class_id_reference="18" object_id="_388"> <Obj> <type>3</type> <id>283</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>281</item> <item>282</item> </node_objs> </item> <item class_id_reference="18" object_id="_389"> <Obj> <type>3</type> <id>285</id> <name>._crit_edge29.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>284</item> </node_objs> </item> <item class_id_reference="18" object_id="_390"> <Obj> <type>3</type> <id>291</id> <name>._crit_edge28.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>286</item> <item>287</item> <item>288</item> <item>289</item> <item>290</item> </node_objs> </item> <item class_id_reference="18" object_id="_391"> <Obj> <type>3</type> <id>296</id> <name>._crit_edge30.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>292</item> <item>293</item> <item>294</item> <item>295</item> </node_objs> </item> <item class_id_reference="18" object_id="_392"> <Obj> <type>3</type> <id>300</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>297</item> <item>298</item> <item>299</item> </node_objs> </item> <item class_id_reference="18" object_id="_393"> <Obj> <type>3</type> <id>305</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>301</item> <item>302</item> <item>303</item> <item>304</item> </node_objs> </item> <item class_id_reference="18" object_id="_394"> <Obj> <type>3</type> <id>309</id> <name>._crit_edge24.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>306</item> <item>307</item> <item>308</item> </node_objs> </item> <item class_id_reference="18" object_id="_395"> <Obj> <type>3</type> <id>311</id> <name>._crit_edge26.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>310</item> </node_objs> </item> <item class_id_reference="18" object_id="_396"> <Obj> <type>3</type> <id>329</id> <name>_ifconv.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>312</item> <item>313</item> <item>314</item> <item>315</item> <item>316</item> <item>317</item> <item>318</item> <item>319</item> <item>320</item> <item>321</item> <item>322</item> <item>323</item> <item>324</item> <item>325</item> <item>326</item> <item>327</item> <item>328</item> </node_objs> </item> <item class_id_reference="18" object_id="_397"> <Obj> <type>3</type> <id>358</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>28</count> <item_version>0</item_version> <item>330</item> <item>331</item> <item>332</item> <item>333</item> <item>334</item> <item>335</item> <item>336</item> <item>337</item> <item>338</item> <item>339</item> <item>340</item> <item>341</item> <item>342</item> <item>343</item> <item>344</item> <item>345</item> <item>346</item> <item>347</item> <item>348</item> <item>349</item> <item>350</item> <item>351</item> <item>352</item> <item>353</item> <item>354</item> <item>355</item> <item>356</item> <item>357</item> </node_objs> </item> <item class_id_reference="18" object_id="_398"> <Obj> <type>3</type> <id>387</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>28</count> <item_version>0</item_version> <item>359</item> <item>360</item> <item>361</item> <item>362</item> <item>363</item> <item>364</item> <item>365</item> <item>366</item> <item>367</item> <item>368</item> <item>369</item> <item>370</item> <item>371</item> <item>372</item> <item>373</item> <item>374</item> <item>375</item> <item>376</item> <item>377</item> <item>378</item> <item>379</item> <item>380</item> <item>381</item> <item>382</item> <item>383</item> <item>384</item> <item>385</item> <item>386</item> </node_objs> </item> <item class_id_reference="18" object_id="_399"> <Obj> <type>3</type> <id>395</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>7</count> <item_version>0</item_version> <item>388</item> <item>389</item> <item>390</item> <item>391</item> <item>392</item> <item>393</item> <item>394</item> </node_objs> </item> <item class_id_reference="18" object_id="_400"> <Obj> <type>3</type> <id>399</id> <name>._crit_edge27.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>396</item> <item>397</item> <item>398</item> </node_objs> </item> <item class_id_reference="18" object_id="_401"> <Obj> <type>3</type> <id>402</id> <name>mergeST.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>400</item> <item>401</item> </node_objs> </item> <item class_id_reference="18" object_id="_402"> <Obj> <type>3</type> <id>404</id> <name>.new.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>403</item> </node_objs> </item> <item class_id_reference="18" object_id="_403"> <Obj> <type>3</type> <id>407</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>405</item> <item>406</item> </node_objs> </item> <item class_id_reference="18" object_id="_404"> <Obj> <type>3</type> <id>411</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>408</item> <item>409</item> <item>410</item> </node_objs> </item> <item class_id_reference="18" object_id="_405"> <Obj> <type>3</type> <id>415</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>412</item> <item>413</item> <item>414</item> </node_objs> </item> <item class_id_reference="18" object_id="_406"> <Obj> <type>3</type> <id>419</id> <name>._crit_edge22.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>416</item> <item>417</item> <item>418</item> </node_objs> </item> <item class_id_reference="18" object_id="_407"> <Obj> <type>3</type> <id>421</id> <name>._crit_edge19.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>420</item> </node_objs> </item> <item class_id_reference="18" object_id="_408"> <Obj> <type>3</type> <id>424</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>422</item> <item>423</item> </node_objs> </item> <item class_id_reference="18" object_id="_409"> <Obj> <type>3</type> <id>426</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>425</item> </node_objs> </item> <item class_id_reference="18" object_id="_410"> <Obj> <type>3</type> <id>431</id> <name>._crit_edge18.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>427</item> <item>428</item> <item>429</item> <item>430</item> </node_objs> </item> <item class_id_reference="18" object_id="_411"> <Obj> <type>3</type> <id>436</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>432</item> <item>433</item> <item>434</item> <item>435</item> </node_objs> </item> <item class_id_reference="18" object_id="_412"> <Obj> <type>3</type> <id>438</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>437</item> </node_objs> </item> <item class_id_reference="18" object_id="_413"> <Obj> <type>3</type> <id>449</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>10</count> <item_version>0</item_version> <item>439</item> <item>440</item> <item>441</item> <item>442</item> <item>443</item> <item>444</item> <item>445</item> <item>446</item> <item>447</item> <item>448</item> </node_objs> </item> <item class_id_reference="18" object_id="_414"> <Obj> <type>3</type> <id>451</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>450</item> </node_objs> </item> <item class_id_reference="18" object_id="_415"> <Obj> <type>3</type> <id>454</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>452</item> <item>453</item> </node_objs> </item> <item class_id_reference="18" object_id="_416"> <Obj> <type>3</type> <id>459</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>455</item> <item>456</item> <item>457</item> <item>458</item> </node_objs> </item> <item class_id_reference="18" object_id="_417"> <Obj> <type>3</type> <id>462</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>460</item> <item>461</item> </node_objs> </item> <item class_id_reference="18" object_id="_418"> <Obj> <type>3</type> <id>465</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>463</item> <item>464</item> </node_objs> </item> <item class_id_reference="18" object_id="_419"> <Obj> <type>3</type> <id>467</id> <name>._crit_edge14.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>466</item> </node_objs> </item> <item class_id_reference="18" object_id="_420"> <Obj> <type>3</type> <id>473</id> <name>._crit_edge11.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>468</item> <item>469</item> <item>470</item> <item>471</item> <item>472</item> </node_objs> </item> <item class_id_reference="18" object_id="_421"> <Obj> <type>3</type> <id>475</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>474</item> </node_objs> </item> <item class_id_reference="18" object_id="_422"> <Obj> <type>3</type> <id>478</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>476</item> <item>477</item> </node_objs> </item> <item class_id_reference="18" object_id="_423"> <Obj> <type>3</type> <id>480</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>479</item> </node_objs> </item> <item class_id_reference="18" object_id="_424"> <Obj> <type>3</type> <id>482</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>481</item> </node_objs> </item> <item class_id_reference="18" object_id="_425"> <Obj> <type>3</type> <id>500</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>483</item> <item>484</item> <item>485</item> <item>486</item> <item>487</item> <item>488</item> <item>489</item> <item>490</item> <item>491</item> <item>492</item> <item>493</item> <item>494</item> <item>495</item> <item>496</item> <item>497</item> <item>498</item> <item>499</item> </node_objs> </item> <item class_id_reference="18" object_id="_426"> <Obj> <type>3</type> <id>502</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>501</item> </node_objs> </item> <item class_id_reference="18" object_id="_427"> <Obj> <type>3</type> <id>516</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>13</count> <item_version>0</item_version> <item>503</item> <item>504</item> <item>505</item> <item>506</item> <item>507</item> <item>508</item> <item>509</item> <item>510</item> <item>511</item> <item>512</item> <item>513</item> <item>514</item> <item>515</item> </node_objs> </item> <item class_id_reference="18" object_id="_428"> <Obj> <type>3</type> <id>518</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>517</item> </node_objs> </item> <item class_id_reference="18" object_id="_429"> <Obj> <type>3</type> <id>520</id> <name>._crit_edge9.i.i.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>519</item> </node_objs> </item> <item class_id_reference="18" object_id="_430"> <Obj> <type>3</type> <id>525</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>521</item> <item>522</item> <item>523</item> <item>524</item> </node_objs> </item> <item class_id_reference="18" object_id="_431"> <Obj> <type>3</type> <id>527</id> <name>.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>526</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>731</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_432"> <id>530</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_433"> <id>533</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_434"> <id>534</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_435"> <id>535</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>163</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_436"> <id>536</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_437"> <id>537</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_438"> <id>538</id> <edge_type>1</edge_type> <source_obj>163</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_439"> <id>539</id> <edge_type>2</edge_type> <source_obj>170</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_440"> <id>540</id> <edge_type>2</edge_type> <source_obj>525</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_441"> <id>543</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_442"> <id>544</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_443"> <id>545</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_444"> <id>546</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_445"> <id>548</id> <edge_type>1</edge_type> <source_obj>547</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_446"> <id>549</id> <edge_type>1</edge_type> <source_obj>168</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_447"> <id>550</id> <edge_type>2</edge_type> <source_obj>520</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_448"> <id>551</id> <edge_type>2</edge_type> <source_obj>184</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_449"> <id>554</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_450"> <id>555</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_451"> <id>556</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_452"> <id>557</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_453"> <id>558</id> <edge_type>1</edge_type> <source_obj>171</source_obj> <sink_obj>172</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_454"> <id>559</id> <edge_type>1</edge_type> <source_obj>171</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_455"> <id>560</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_456"> <id>562</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_457"> <id>563</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>175</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_458"> <id>564</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_459"> <id>565</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>177</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_460"> <id>566</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_461"> <id>567</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>179</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_462"> <id>568</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>180</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_463"> <id>570</id> <edge_type>1</edge_type> <source_obj>569</source_obj> <sink_obj>180</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_464"> <id>571</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_465"> <id>573</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_466"> <id>574</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_467"> <id>575</id> <edge_type>1</edge_type> <source_obj>180</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_468"> <id>576</id> <edge_type>1</edge_type> <source_obj>174</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_469"> <id>577</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_470"> <id>578</id> <edge_type>2</edge_type> <source_obj>516</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_471"> <id>579</id> <edge_type>1</edge_type> <source_obj>173</source_obj> <sink_obj>503</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_472"> <id>580</id> <edge_type>1</edge_type> <source_obj>503</source_obj> <sink_obj>504</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_473"> <id>583</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>505</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_474"> <id>584</id> <edge_type>1</edge_type> <source_obj>504</source_obj> <sink_obj>505</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_475"> <id>586</id> <edge_type>1</edge_type> <source_obj>585</source_obj> <sink_obj>505</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_476"> <id>588</id> <edge_type>1</edge_type> <source_obj>587</source_obj> <sink_obj>505</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_477"> <id>589</id> <edge_type>1</edge_type> <source_obj>505</source_obj> <sink_obj>506</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_478"> <id>590</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>506</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_479"> <id>593</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>507</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_480"> <id>595</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>507</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_481"> <id>597</id> <edge_type>1</edge_type> <source_obj>596</source_obj> <sink_obj>507</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_482"> <id>598</id> <edge_type>1</edge_type> <source_obj>507</source_obj> <sink_obj>508</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_483"> <id>599</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>508</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_484"> <id>600</id> <edge_type>1</edge_type> <source_obj>507</source_obj> <sink_obj>509</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_485"> <id>601</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>509</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_486"> <id>603</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>510</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_487"> <id>605</id> <edge_type>1</edge_type> <source_obj>604</source_obj> <sink_obj>510</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_488"> <id>607</id> <edge_type>1</edge_type> <source_obj>606</source_obj> <sink_obj>510</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_489"> <id>608</id> <edge_type>1</edge_type> <source_obj>510</source_obj> <sink_obj>511</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_490"> <id>609</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>511</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_491"> <id>610</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>512</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_492"> <id>611</id> <edge_type>1</edge_type> <source_obj>512</source_obj> <sink_obj>513</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_493"> <id>612</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>513</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_494"> <id>614</id> <edge_type>1</edge_type> <source_obj>613</source_obj> <sink_obj>514</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_495"> <id>615</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>514</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_496"> <id>616</id> <edge_type>2</edge_type> <source_obj>518</source_obj> <sink_obj>515</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_497"> <id>617</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_498"> <id>618</id> <edge_type>1</edge_type> <source_obj>613</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_499"> <id>619</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_500"> <id>620</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_501"> <id>621</id> <edge_type>2</edge_type> <source_obj>191</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_502"> <id>622</id> <edge_type>2</edge_type> <source_obj>500</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_503"> <id>624</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>483</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_504"> <id>625</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>483</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_505"> <id>626</id> <edge_type>1</edge_type> <source_obj>596</source_obj> <sink_obj>483</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_506"> <id>628</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>484</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_507"> <id>630</id> <edge_type>1</edge_type> <source_obj>629</source_obj> <sink_obj>484</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_508"> <id>632</id> <edge_type>1</edge_type> <source_obj>631</source_obj> <sink_obj>484</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_509"> <id>635</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>485</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_510"> <id>636</id> <edge_type>1</edge_type> <source_obj>604</source_obj> <sink_obj>485</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_511"> <id>639</id> <edge_type>1</edge_type> <source_obj>485</source_obj> <sink_obj>486</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_512"> <id>640</id> <edge_type>1</edge_type> <source_obj>484</source_obj> <sink_obj>486</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_513"> <id>641</id> <edge_type>1</edge_type> <source_obj>483</source_obj> <sink_obj>486</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_514"> <id>642</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>487</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_515"> <id>643</id> <edge_type>1</edge_type> <source_obj>486</source_obj> <sink_obj>488</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_516"> <id>644</id> <edge_type>1</edge_type> <source_obj>487</source_obj> <sink_obj>488</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_517"> <id>645</id> <edge_type>1</edge_type> <source_obj>488</source_obj> <sink_obj>489</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_518"> <id>646</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>489</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_519"> <id>649</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>490</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_520"> <id>650</id> <edge_type>1</edge_type> <source_obj>179</source_obj> <sink_obj>490</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_521"> <id>652</id> <edge_type>1</edge_type> <source_obj>651</source_obj> <sink_obj>490</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_522"> <id>654</id> <edge_type>1</edge_type> <source_obj>653</source_obj> <sink_obj>490</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_523"> <id>657</id> <edge_type>1</edge_type> <source_obj>490</source_obj> <sink_obj>491</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_524"> <id>658</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>491</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_525"> <id>660</id> <edge_type>1</edge_type> <source_obj>659</source_obj> <sink_obj>491</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_526"> <id>662</id> <edge_type>1</edge_type> <source_obj>661</source_obj> <sink_obj>491</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_527"> <id>663</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>492</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_528"> <id>666</id> <edge_type>1</edge_type> <source_obj>491</source_obj> <sink_obj>493</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_529"> <id>667</id> <edge_type>1</edge_type> <source_obj>492</source_obj> <sink_obj>493</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_530"> <id>669</id> <edge_type>1</edge_type> <source_obj>668</source_obj> <sink_obj>493</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_531"> <id>671</id> <edge_type>1</edge_type> <source_obj>670</source_obj> <sink_obj>493</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_532"> <id>674</id> <edge_type>1</edge_type> <source_obj>488</source_obj> <sink_obj>494</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_533"> <id>675</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>494</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_534"> <id>678</id> <edge_type>1</edge_type> <source_obj>493</source_obj> <sink_obj>495</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_535"> <id>679</id> <edge_type>1</edge_type> <source_obj>494</source_obj> <sink_obj>495</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_536"> <id>681</id> <edge_type>1</edge_type> <source_obj>680</source_obj> <sink_obj>495</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_537"> <id>682</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>495</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_538"> <id>683</id> <edge_type>1</edge_type> <source_obj>495</source_obj> <sink_obj>496</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_539"> <id>684</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>496</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_540"> <id>687</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>497</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_541"> <id>688</id> <edge_type>1</edge_type> <source_obj>495</source_obj> <sink_obj>497</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_542"> <id>690</id> <edge_type>1</edge_type> <source_obj>689</source_obj> <sink_obj>498</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_543"> <id>691</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>498</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_544"> <id>692</id> <edge_type>2</edge_type> <source_obj>502</source_obj> <sink_obj>499</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_545"> <id>693</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_546"> <id>694</id> <edge_type>1</edge_type> <source_obj>689</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_547"> <id>695</id> <edge_type>1</edge_type> <source_obj>189</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_548"> <id>696</id> <edge_type>2</edge_type> <source_obj>194</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_549"> <id>697</id> <edge_type>2</edge_type> <source_obj>454</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_550"> <id>698</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>452</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_551"> <id>700</id> <edge_type>1</edge_type> <source_obj>699</source_obj> <sink_obj>452</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_552"> <id>701</id> <edge_type>1</edge_type> <source_obj>452</source_obj> <sink_obj>453</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_553"> <id>702</id> <edge_type>2</edge_type> <source_obj>459</source_obj> <sink_obj>453</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_554"> <id>703</id> <edge_type>2</edge_type> <source_obj>478</source_obj> <sink_obj>453</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_555"> <id>705</id> <edge_type>1</edge_type> <source_obj>704</source_obj> <sink_obj>476</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_556"> <id>706</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>476</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_557"> <id>707</id> <edge_type>2</edge_type> <source_obj>480</source_obj> <sink_obj>477</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_558"> <id>708</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>455</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_559"> <id>709</id> <edge_type>1</edge_type> <source_obj>569</source_obj> <sink_obj>455</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_560"> <id>710</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>456</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_561"> <id>711</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>456</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_562"> <id>712</id> <edge_type>1</edge_type> <source_obj>456</source_obj> <sink_obj>457</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_563"> <id>713</id> <edge_type>1</edge_type> <source_obj>455</source_obj> <sink_obj>457</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_564"> <id>714</id> <edge_type>1</edge_type> <source_obj>457</source_obj> <sink_obj>458</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_565"> <id>715</id> <edge_type>2</edge_type> <source_obj>462</source_obj> <sink_obj>458</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_566"> <id>716</id> <edge_type>2</edge_type> <source_obj>473</source_obj> <sink_obj>458</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_567"> <id>719</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>468</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_568"> <id>721</id> <edge_type>1</edge_type> <source_obj>720</source_obj> <sink_obj>468</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_569"> <id>723</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>468</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_570"> <id>724</id> <edge_type>1</edge_type> <source_obj>468</source_obj> <sink_obj>469</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_571"> <id>726</id> <edge_type>1</edge_type> <source_obj>725</source_obj> <sink_obj>469</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_572"> <id>727</id> <edge_type>1</edge_type> <source_obj>469</source_obj> <sink_obj>470</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_573"> <id>729</id> <edge_type>1</edge_type> <source_obj>728</source_obj> <sink_obj>470</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_574"> <id>731</id> <edge_type>1</edge_type> <source_obj>730</source_obj> <sink_obj>470</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_575"> <id>732</id> <edge_type>1</edge_type> <source_obj>470</source_obj> <sink_obj>471</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_576"> <id>733</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>471</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_577"> <id>734</id> <edge_type>2</edge_type> <source_obj>475</source_obj> <sink_obj>472</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_578"> <id>735</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>460</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_579"> <id>737</id> <edge_type>1</edge_type> <source_obj>736</source_obj> <sink_obj>460</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_580"> <id>738</id> <edge_type>1</edge_type> <source_obj>460</source_obj> <sink_obj>461</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_581"> <id>739</id> <edge_type>2</edge_type> <source_obj>467</source_obj> <sink_obj>461</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_582"> <id>740</id> <edge_type>2</edge_type> <source_obj>465</source_obj> <sink_obj>461</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_583"> <id>741</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>463</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_584"> <id>742</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>463</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_585"> <id>743</id> <edge_type>2</edge_type> <source_obj>467</source_obj> <sink_obj>464</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_586"> <id>744</id> <edge_type>2</edge_type> <source_obj>475</source_obj> <sink_obj>466</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_587"> <id>745</id> <edge_type>2</edge_type> <source_obj>480</source_obj> <sink_obj>474</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_588"> <id>746</id> <edge_type>2</edge_type> <source_obj>482</source_obj> <sink_obj>479</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_589"> <id>747</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_590"> <id>748</id> <edge_type>1</edge_type> <source_obj>704</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_591"> <id>749</id> <edge_type>1</edge_type> <source_obj>192</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_592"> <id>750</id> <edge_type>2</edge_type> <source_obj>198</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_593"> <id>751</id> <edge_type>2</edge_type> <source_obj>449</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_594"> <id>752</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>439</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_595"> <id>753</id> <edge_type>1</edge_type> <source_obj>439</source_obj> <sink_obj>440</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_596"> <id>756</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>441</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_597"> <id>757</id> <edge_type>1</edge_type> <source_obj>440</source_obj> <sink_obj>441</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_598"> <id>759</id> <edge_type>1</edge_type> <source_obj>758</source_obj> <sink_obj>442</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_599"> <id>760</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>442</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_600"> <id>761</id> <edge_type>1</edge_type> <source_obj>442</source_obj> <sink_obj>443</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_601"> <id>762</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>443</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_602"> <id>764</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>444</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_603"> <id>765</id> <edge_type>1</edge_type> <source_obj>720</source_obj> <sink_obj>444</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_604"> <id>766</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>444</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_605"> <id>767</id> <edge_type>1</edge_type> <source_obj>444</source_obj> <sink_obj>445</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_606"> <id>768</id> <edge_type>1</edge_type> <source_obj>725</source_obj> <sink_obj>445</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_607"> <id>769</id> <edge_type>1</edge_type> <source_obj>445</source_obj> <sink_obj>446</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_608"> <id>770</id> <edge_type>1</edge_type> <source_obj>728</source_obj> <sink_obj>446</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_609"> <id>771</id> <edge_type>1</edge_type> <source_obj>730</source_obj> <sink_obj>446</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_610"> <id>772</id> <edge_type>1</edge_type> <source_obj>446</source_obj> <sink_obj>447</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_611"> <id>773</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>447</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_612"> <id>774</id> <edge_type>2</edge_type> <source_obj>451</source_obj> <sink_obj>448</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_613"> <id>775</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_614"> <id>776</id> <edge_type>1</edge_type> <source_obj>728</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_615"> <id>777</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_616"> <id>778</id> <edge_type>1</edge_type> <source_obj>195</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_617"> <id>779</id> <edge_type>2</edge_type> <source_obj>201</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_618"> <id>780</id> <edge_type>2</edge_type> <source_obj>407</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_619"> <id>781</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>405</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_620"> <id>782</id> <edge_type>1</edge_type> <source_obj>736</source_obj> <sink_obj>405</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_621"> <id>783</id> <edge_type>1</edge_type> <source_obj>405</source_obj> <sink_obj>406</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_622"> <id>784</id> <edge_type>2</edge_type> <source_obj>411</source_obj> <sink_obj>406</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_623"> <id>785</id> <edge_type>2</edge_type> <source_obj>431</source_obj> <sink_obj>406</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_624"> <id>786</id> <edge_type>1</edge_type> <source_obj>182</source_obj> <sink_obj>427</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_625"> <id>787</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>427</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_626"> <id>789</id> <edge_type>1</edge_type> <source_obj>788</source_obj> <sink_obj>427</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_627"> <id>790</id> <edge_type>1</edge_type> <source_obj>427</source_obj> <sink_obj>428</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_628"> <id>791</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>428</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_629"> <id>792</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>429</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_630"> <id>793</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>429</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_631"> <id>794</id> <edge_type>2</edge_type> <source_obj>436</source_obj> <sink_obj>430</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_632"> <id>796</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>408</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_633"> <id>797</id> <edge_type>1</edge_type> <source_obj>720</source_obj> <sink_obj>408</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_634"> <id>798</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>408</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_635"> <id>799</id> <edge_type>1</edge_type> <source_obj>408</source_obj> <sink_obj>409</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_636"> <id>800</id> <edge_type>1</edge_type> <source_obj>725</source_obj> <sink_obj>409</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_637"> <id>801</id> <edge_type>1</edge_type> <source_obj>409</source_obj> <sink_obj>410</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_638"> <id>802</id> <edge_type>2</edge_type> <source_obj>415</source_obj> <sink_obj>410</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_639"> <id>803</id> <edge_type>2</edge_type> <source_obj>424</source_obj> <sink_obj>410</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_640"> <id>804</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>422</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_641"> <id>805</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>422</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_642"> <id>806</id> <edge_type>2</edge_type> <source_obj>426</source_obj> <sink_obj>423</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_643"> <id>809</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>412</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_644"> <id>811</id> <edge_type>1</edge_type> <source_obj>810</source_obj> <sink_obj>412</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_645"> <id>812</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>412</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_646"> <id>813</id> <edge_type>1</edge_type> <source_obj>412</source_obj> <sink_obj>413</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_647"> <id>814</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>413</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_648"> <id>815</id> <edge_type>1</edge_type> <source_obj>413</source_obj> <sink_obj>414</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_649"> <id>816</id> <edge_type>2</edge_type> <source_obj>421</source_obj> <sink_obj>414</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_650"> <id>817</id> <edge_type>2</edge_type> <source_obj>419</source_obj> <sink_obj>414</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_651"> <id>818</id> <edge_type>1</edge_type> <source_obj>182</source_obj> <sink_obj>416</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_652"> <id>819</id> <edge_type>1</edge_type> <source_obj>728</source_obj> <sink_obj>416</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_653"> <id>820</id> <edge_type>1</edge_type> <source_obj>730</source_obj> <sink_obj>416</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_654"> <id>821</id> <edge_type>1</edge_type> <source_obj>416</source_obj> <sink_obj>417</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_655"> <id>822</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>417</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_656"> <id>823</id> <edge_type>2</edge_type> <source_obj>421</source_obj> <sink_obj>418</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_657"> <id>824</id> <edge_type>2</edge_type> <source_obj>426</source_obj> <sink_obj>420</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_658"> <id>825</id> <edge_type>2</edge_type> <source_obj>436</source_obj> <sink_obj>425</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_659"> <id>827</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>432</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_660"> <id>828</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>432</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_661"> <id>829</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>433</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_662"> <id>831</id> <edge_type>1</edge_type> <source_obj>830</source_obj> <sink_obj>433</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_663"> <id>832</id> <edge_type>1</edge_type> <source_obj>433</source_obj> <sink_obj>434</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_664"> <id>833</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>434</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_665"> <id>834</id> <edge_type>2</edge_type> <source_obj>438</source_obj> <sink_obj>435</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_666"> <id>835</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_667"> <id>836</id> <edge_type>1</edge_type> <source_obj>730</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_668"> <id>837</id> <edge_type>1</edge_type> <source_obj>199</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_669"> <id>838</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_670"> <id>839</id> <edge_type>2</edge_type> <source_obj>300</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_671"> <id>841</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>297</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_672"> <id>842</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>297</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_673"> <id>843</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>298</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_674"> <id>844</id> <edge_type>1</edge_type> <source_obj>699</source_obj> <sink_obj>298</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_675"> <id>845</id> <edge_type>1</edge_type> <source_obj>298</source_obj> <sink_obj>299</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_676"> <id>846</id> <edge_type>2</edge_type> <source_obj>305</source_obj> <sink_obj>299</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_677"> <id>847</id> <edge_type>2</edge_type> <source_obj>329</source_obj> <sink_obj>299</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_678"> <id>848</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>312</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_679"> <id>850</id> <edge_type>1</edge_type> <source_obj>849</source_obj> <sink_obj>313</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_680"> <id>851</id> <edge_type>1</edge_type> <source_obj>312</source_obj> <sink_obj>313</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_681"> <id>852</id> <edge_type>1</edge_type> <source_obj>313</source_obj> <sink_obj>314</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_682"> <id>855</id> <edge_type>1</edge_type> <source_obj>313</source_obj> <sink_obj>315</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_683"> <id>857</id> <edge_type>1</edge_type> <source_obj>856</source_obj> <sink_obj>315</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_684"> <id>858</id> <edge_type>1</edge_type> <source_obj>315</source_obj> <sink_obj>316</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_685"> <id>859</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>316</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_686"> <id>860</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>317</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_687"> <id>862</id> <edge_type>1</edge_type> <source_obj>861</source_obj> <sink_obj>318</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_688"> <id>863</id> <edge_type>1</edge_type> <source_obj>317</source_obj> <sink_obj>318</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_689"> <id>864</id> <edge_type>1</edge_type> <source_obj>318</source_obj> <sink_obj>319</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_690"> <id>865</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>320</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_691"> <id>866</id> <edge_type>1</edge_type> <source_obj>320</source_obj> <sink_obj>321</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_692"> <id>867</id> <edge_type>1</edge_type> <source_obj>319</source_obj> <sink_obj>321</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_693"> <id>868</id> <edge_type>1</edge_type> <source_obj>317</source_obj> <sink_obj>322</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_694"> <id>870</id> <edge_type>1</edge_type> <source_obj>869</source_obj> <sink_obj>322</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_695"> <id>871</id> <edge_type>1</edge_type> <source_obj>322</source_obj> <sink_obj>323</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_696"> <id>872</id> <edge_type>1</edge_type> <source_obj>323</source_obj> <sink_obj>324</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_697"> <id>873</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>324</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_698"> <id>874</id> <edge_type>1</edge_type> <source_obj>321</source_obj> <sink_obj>325</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_699"> <id>875</id> <edge_type>1</edge_type> <source_obj>324</source_obj> <sink_obj>325</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_700"> <id>877</id> <edge_type>1</edge_type> <source_obj>876</source_obj> <sink_obj>325</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_701"> <id>878</id> <edge_type>1</edge_type> <source_obj>325</source_obj> <sink_obj>326</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_702"> <id>879</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>326</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_703"> <id>880</id> <edge_type>1</edge_type> <source_obj>325</source_obj> <sink_obj>327</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_704"> <id>881</id> <edge_type>1</edge_type> <source_obj>876</source_obj> <sink_obj>327</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_705"> <id>882</id> <edge_type>1</edge_type> <source_obj>327</source_obj> <sink_obj>328</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_706"> <id>883</id> <edge_type>2</edge_type> <source_obj>358</source_obj> <sink_obj>328</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_707"> <id>884</id> <edge_type>2</edge_type> <source_obj>387</source_obj> <sink_obj>328</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_708"> <id>885</id> <edge_type>1</edge_type> <source_obj>315</source_obj> <sink_obj>330</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_709"> <id>888</id> <edge_type>1</edge_type> <source_obj>314</source_obj> <sink_obj>331</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_710"> <id>889</id> <edge_type>1</edge_type> <source_obj>856</source_obj> <sink_obj>331</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_711"> <id>891</id> <edge_type>1</edge_type> <source_obj>890</source_obj> <sink_obj>332</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_712"> <id>892</id> <edge_type>1</edge_type> <source_obj>330</source_obj> <sink_obj>332</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_713"> <id>895</id> <edge_type>1</edge_type> <source_obj>332</source_obj> <sink_obj>333</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_714"> <id>897</id> <edge_type>1</edge_type> <source_obj>896</source_obj> <sink_obj>333</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_715"> <id>898</id> <edge_type>1</edge_type> <source_obj>604</source_obj> <sink_obj>333</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_716"> <id>899</id> <edge_type>1</edge_type> <source_obj>333</source_obj> <sink_obj>334</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_717"> <id>900</id> <edge_type>1</edge_type> <source_obj>334</source_obj> <sink_obj>335</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_718"> <id>902</id> <edge_type>1</edge_type> <source_obj>901</source_obj> <sink_obj>335</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_719"> <id>903</id> <edge_type>1</edge_type> <source_obj>332</source_obj> <sink_obj>336</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_720"> <id>906</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>337</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_721"> <id>908</id> <edge_type>1</edge_type> <source_obj>907</source_obj> <sink_obj>337</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_722"> <id>909</id> <edge_type>1</edge_type> <source_obj>680</source_obj> <sink_obj>337</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_723"> <id>911</id> <edge_type>1</edge_type> <source_obj>910</source_obj> <sink_obj>338</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_724"> <id>912</id> <edge_type>1</edge_type> <source_obj>336</source_obj> <sink_obj>338</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_725"> <id>914</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>339</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_726"> <id>915</id> <edge_type>1</edge_type> <source_obj>336</source_obj> <sink_obj>339</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_727"> <id>916</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>340</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_728"> <id>917</id> <edge_type>1</edge_type> <source_obj>336</source_obj> <sink_obj>340</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_729"> <id>918</id> <edge_type>1</edge_type> <source_obj>335</source_obj> <sink_obj>341</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_730"> <id>919</id> <edge_type>1</edge_type> <source_obj>338</source_obj> <sink_obj>341</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_731"> <id>920</id> <edge_type>1</edge_type> <source_obj>340</source_obj> <sink_obj>341</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_732"> <id>921</id> <edge_type>1</edge_type> <source_obj>335</source_obj> <sink_obj>342</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_733"> <id>922</id> <edge_type>1</edge_type> <source_obj>337</source_obj> <sink_obj>342</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_734"> <id>923</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>342</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_735"> <id>924</id> <edge_type>1</edge_type> <source_obj>335</source_obj> <sink_obj>343</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_736"> <id>925</id> <edge_type>1</edge_type> <source_obj>339</source_obj> <sink_obj>343</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_737"> <id>926</id> <edge_type>1</edge_type> <source_obj>336</source_obj> <sink_obj>343</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_738"> <id>927</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>344</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_739"> <id>928</id> <edge_type>1</edge_type> <source_obj>341</source_obj> <sink_obj>344</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_740"> <id>929</id> <edge_type>1</edge_type> <source_obj>343</source_obj> <sink_obj>345</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_741"> <id>930</id> <edge_type>1</edge_type> <source_obj>344</source_obj> <sink_obj>346</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_742"> <id>931</id> <edge_type>1</edge_type> <source_obj>342</source_obj> <sink_obj>347</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_743"> <id>932</id> <edge_type>1</edge_type> <source_obj>345</source_obj> <sink_obj>347</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_744"> <id>934</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>348</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_745"> <id>935</id> <edge_type>1</edge_type> <source_obj>346</source_obj> <sink_obj>348</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_746"> <id>936</id> <edge_type>1</edge_type> <source_obj>347</source_obj> <sink_obj>349</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_747"> <id>937</id> <edge_type>1</edge_type> <source_obj>348</source_obj> <sink_obj>349</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_748"> <id>939</id> <edge_type>1</edge_type> <source_obj>938</source_obj> <sink_obj>350</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_749"> <id>940</id> <edge_type>1</edge_type> <source_obj>331</source_obj> <sink_obj>350</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_750"> <id>941</id> <edge_type>1</edge_type> <source_obj>350</source_obj> <sink_obj>351</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_751"> <id>942</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>352</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_752"> <id>943</id> <edge_type>1</edge_type> <source_obj>351</source_obj> <sink_obj>352</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_753"> <id>944</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>353</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_754"> <id>945</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>353</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_755"> <id>946</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>354</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_756"> <id>947</id> <edge_type>1</edge_type> <source_obj>353</source_obj> <sink_obj>354</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_757"> <id>948</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>355</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_758"> <id>949</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>355</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_759"> <id>950</id> <edge_type>1</edge_type> <source_obj>354</source_obj> <sink_obj>356</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_760"> <id>951</id> <edge_type>1</edge_type> <source_obj>355</source_obj> <sink_obj>356</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_761"> <id>952</id> <edge_type>2</edge_type> <source_obj>395</source_obj> <sink_obj>357</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_762"> <id>953</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>359</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_763"> <id>954</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>360</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_764"> <id>956</id> <edge_type>1</edge_type> <source_obj>360</source_obj> <sink_obj>361</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_765"> <id>957</id> <edge_type>1</edge_type> <source_obj>856</source_obj> <sink_obj>361</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_766"> <id>959</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>362</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_767"> <id>960</id> <edge_type>1</edge_type> <source_obj>720</source_obj> <sink_obj>362</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_768"> <id>961</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>362</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_769"> <id>962</id> <edge_type>1</edge_type> <source_obj>362</source_obj> <sink_obj>363</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_770"> <id>963</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>364</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_771"> <id>964</id> <edge_type>1</edge_type> <source_obj>901</source_obj> <sink_obj>364</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_772"> <id>966</id> <edge_type>1</edge_type> <source_obj>359</source_obj> <sink_obj>365</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_773"> <id>967</id> <edge_type>1</edge_type> <source_obj>856</source_obj> <sink_obj>365</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_774"> <id>969</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>366</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_775"> <id>970</id> <edge_type>1</edge_type> <source_obj>907</source_obj> <sink_obj>366</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_776"> <id>971</id> <edge_type>1</edge_type> <source_obj>680</source_obj> <sink_obj>366</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_777"> <id>972</id> <edge_type>1</edge_type> <source_obj>365</source_obj> <sink_obj>367</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_778"> <id>973</id> <edge_type>1</edge_type> <source_obj>910</source_obj> <sink_obj>367</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_779"> <id>974</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>368</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_780"> <id>975</id> <edge_type>1</edge_type> <source_obj>365</source_obj> <sink_obj>368</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_781"> <id>976</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>369</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_782"> <id>977</id> <edge_type>1</edge_type> <source_obj>365</source_obj> <sink_obj>369</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_783"> <id>978</id> <edge_type>1</edge_type> <source_obj>364</source_obj> <sink_obj>370</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_784"> <id>979</id> <edge_type>1</edge_type> <source_obj>367</source_obj> <sink_obj>370</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_785"> <id>980</id> <edge_type>1</edge_type> <source_obj>369</source_obj> <sink_obj>370</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_786"> <id>981</id> <edge_type>1</edge_type> <source_obj>364</source_obj> <sink_obj>371</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_787"> <id>982</id> <edge_type>1</edge_type> <source_obj>366</source_obj> <sink_obj>371</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_788"> <id>983</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>371</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_789"> <id>984</id> <edge_type>1</edge_type> <source_obj>364</source_obj> <sink_obj>372</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_790"> <id>985</id> <edge_type>1</edge_type> <source_obj>368</source_obj> <sink_obj>372</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_791"> <id>986</id> <edge_type>1</edge_type> <source_obj>365</source_obj> <sink_obj>372</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_792"> <id>987</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>373</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_793"> <id>988</id> <edge_type>1</edge_type> <source_obj>370</source_obj> <sink_obj>373</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_794"> <id>989</id> <edge_type>1</edge_type> <source_obj>372</source_obj> <sink_obj>374</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_795"> <id>990</id> <edge_type>1</edge_type> <source_obj>373</source_obj> <sink_obj>375</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_796"> <id>991</id> <edge_type>1</edge_type> <source_obj>371</source_obj> <sink_obj>376</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_797"> <id>992</id> <edge_type>1</edge_type> <source_obj>374</source_obj> <sink_obj>376</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_798"> <id>993</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>377</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_799"> <id>994</id> <edge_type>1</edge_type> <source_obj>375</source_obj> <sink_obj>377</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_800"> <id>995</id> <edge_type>1</edge_type> <source_obj>376</source_obj> <sink_obj>378</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_801"> <id>996</id> <edge_type>1</edge_type> <source_obj>377</source_obj> <sink_obj>378</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_802"> <id>997</id> <edge_type>1</edge_type> <source_obj>361</source_obj> <sink_obj>379</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_803"> <id>998</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>380</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_804"> <id>999</id> <edge_type>1</edge_type> <source_obj>379</source_obj> <sink_obj>380</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_805"> <id>1000</id> <edge_type>1</edge_type> <source_obj>380</source_obj> <sink_obj>381</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_806"> <id>1001</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>381</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_807"> <id>1002</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>382</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_808"> <id>1003</id> <edge_type>1</edge_type> <source_obj>381</source_obj> <sink_obj>382</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_809"> <id>1004</id> <edge_type>1</edge_type> <source_obj>378</source_obj> <sink_obj>383</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_810"> <id>1005</id> <edge_type>1</edge_type> <source_obj>380</source_obj> <sink_obj>383</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_811"> <id>1006</id> <edge_type>1</edge_type> <source_obj>382</source_obj> <sink_obj>384</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_812"> <id>1007</id> <edge_type>1</edge_type> <source_obj>383</source_obj> <sink_obj>384</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_813"> <id>1009</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>385</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_814"> <id>1010</id> <edge_type>1</edge_type> <source_obj>384</source_obj> <sink_obj>385</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_815"> <id>1011</id> <edge_type>2</edge_type> <source_obj>395</source_obj> <sink_obj>386</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_816"> <id>1012</id> <edge_type>1</edge_type> <source_obj>384</source_obj> <sink_obj>388</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_817"> <id>1013</id> <edge_type>2</edge_type> <source_obj>387</source_obj> <sink_obj>388</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_818"> <id>1014</id> <edge_type>1</edge_type> <source_obj>356</source_obj> <sink_obj>388</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_819"> <id>1015</id> <edge_type>2</edge_type> <source_obj>358</source_obj> <sink_obj>388</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_820"> <id>1017</id> <edge_type>1</edge_type> <source_obj>1016</source_obj> <sink_obj>389</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_821"> <id>1018</id> <edge_type>2</edge_type> <source_obj>387</source_obj> <sink_obj>389</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_822"> <id>1020</id> <edge_type>1</edge_type> <source_obj>1019</source_obj> <sink_obj>389</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_823"> <id>1021</id> <edge_type>2</edge_type> <source_obj>358</source_obj> <sink_obj>389</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_824"> <id>1022</id> <edge_type>1</edge_type> <source_obj>389</source_obj> <sink_obj>390</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_825"> <id>1023</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>391</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_826"> <id>1024</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>391</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_827"> <id>1025</id> <edge_type>1</edge_type> <source_obj>390</source_obj> <sink_obj>392</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_828"> <id>1026</id> <edge_type>1</edge_type> <source_obj>392</source_obj> <sink_obj>393</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_829"> <id>1027</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>393</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_830"> <id>1028</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>394</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_831"> <id>1029</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>301</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_832"> <id>1030</id> <edge_type>1</edge_type> <source_obj>569</source_obj> <sink_obj>301</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_833"> <id>1031</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>302</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_834"> <id>1032</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>302</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_835"> <id>1033</id> <edge_type>1</edge_type> <source_obj>302</source_obj> <sink_obj>303</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_836"> <id>1034</id> <edge_type>1</edge_type> <source_obj>301</source_obj> <sink_obj>303</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_837"> <id>1035</id> <edge_type>1</edge_type> <source_obj>303</source_obj> <sink_obj>304</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_838"> <id>1036</id> <edge_type>2</edge_type> <source_obj>311</source_obj> <sink_obj>304</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_839"> <id>1037</id> <edge_type>2</edge_type> <source_obj>309</source_obj> <sink_obj>304</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_840"> <id>1038</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>306</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_841"> <id>1039</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>306</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_842"> <id>1040</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>307</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_843"> <id>1041</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>307</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_844"> <id>1042</id> <edge_type>2</edge_type> <source_obj>311</source_obj> <sink_obj>308</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_845"> <id>1043</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>310</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_846"> <id>1044</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_847"> <id>1045</id> <edge_type>1</edge_type> <source_obj>788</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_848"> <id>1046</id> <edge_type>1</edge_type> <source_obj>202</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_849"> <id>1047</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_850"> <id>1048</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_851"> <id>1049</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>205</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_852"> <id>1051</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_853"> <id>1052</id> <edge_type>1</edge_type> <source_obj>720</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_854"> <id>1053</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_855"> <id>1054</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_856"> <id>1056</id> <edge_type>1</edge_type> <source_obj>1055</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_857"> <id>1057</id> <edge_type>1</edge_type> <source_obj>207</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_858"> <id>1058</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_859"> <id>1059</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_860"> <id>1060</id> <edge_type>1</edge_type> <source_obj>210</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_861"> <id>1061</id> <edge_type>1</edge_type> <source_obj>209</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_862"> <id>1062</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_863"> <id>1063</id> <edge_type>1</edge_type> <source_obj>212</source_obj> <sink_obj>213</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_864"> <id>1064</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_865"> <id>1065</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_866"> <id>1066</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_867"> <id>1067</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_868"> <id>1070</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_869"> <id>1071</id> <edge_type>1</edge_type> <source_obj>896</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_870"> <id>1072</id> <edge_type>1</edge_type> <source_obj>722</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_871"> <id>1073</id> <edge_type>1</edge_type> <source_obj>216</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_872"> <id>1074</id> <edge_type>1</edge_type> <source_obj>217</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_873"> <id>1075</id> <edge_type>1</edge_type> <source_obj>901</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_874"> <id>1076</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>219</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_875"> <id>1077</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_876"> <id>1078</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_877"> <id>1079</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_878"> <id>1080</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_879"> <id>1081</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_880"> <id>1082</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_881"> <id>1083</id> <edge_type>1</edge_type> <source_obj>220</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_882"> <id>1084</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_883"> <id>1085</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>223</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_884"> <id>1086</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>223</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_885"> <id>1087</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>224</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_886"> <id>1088</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>224</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_887"> <id>1090</id> <edge_type>1</edge_type> <source_obj>1089</source_obj> <sink_obj>224</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_888"> <id>1091</id> <edge_type>1</edge_type> <source_obj>222</source_obj> <sink_obj>225</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_889"> <id>1092</id> <edge_type>1</edge_type> <source_obj>221</source_obj> <sink_obj>226</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_890"> <id>1093</id> <edge_type>1</edge_type> <source_obj>224</source_obj> <sink_obj>227</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_891"> <id>1094</id> <edge_type>1</edge_type> <source_obj>215</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_892"> <id>1095</id> <edge_type>1</edge_type> <source_obj>225</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_893"> <id>1097</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_894"> <id>1098</id> <edge_type>1</edge_type> <source_obj>907</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_895"> <id>1099</id> <edge_type>1</edge_type> <source_obj>680</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_896"> <id>1100</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_897"> <id>1101</id> <edge_type>1</edge_type> <source_obj>229</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_898"> <id>1102</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_899"> <id>1103</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>231</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_900"> <id>1104</id> <edge_type>1</edge_type> <source_obj>226</source_obj> <sink_obj>231</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_901"> <id>1105</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_902"> <id>1106</id> <edge_type>1</edge_type> <source_obj>227</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_903"> <id>1107</id> <edge_type>1</edge_type> <source_obj>231</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_904"> <id>1108</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_905"> <id>1109</id> <edge_type>1</edge_type> <source_obj>233</source_obj> <sink_obj>234</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_906"> <id>1110</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>234</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_907"> <id>1111</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_908"> <id>1112</id> <edge_type>1</edge_type> <source_obj>234</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_909"> <id>1113</id> <edge_type>1</edge_type> <source_obj>230</source_obj> <sink_obj>236</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_910"> <id>1114</id> <edge_type>1</edge_type> <source_obj>233</source_obj> <sink_obj>236</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_911"> <id>1115</id> <edge_type>1</edge_type> <source_obj>235</source_obj> <sink_obj>237</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_912"> <id>1116</id> <edge_type>1</edge_type> <source_obj>236</source_obj> <sink_obj>237</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_913"> <id>1118</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>238</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_914"> <id>1119</id> <edge_type>1</edge_type> <source_obj>237</source_obj> <sink_obj>238</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_915"> <id>1120</id> <edge_type>1</edge_type> <source_obj>211</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_916"> <id>1121</id> <edge_type>2</edge_type> <source_obj>243</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_917"> <id>1122</id> <edge_type>2</edge_type> <source_obj>246</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_918"> <id>1123</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_919"> <id>1124</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_920"> <id>1125</id> <edge_type>2</edge_type> <source_obj>296</source_obj> <sink_obj>242</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_921"> <id>1126</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>244</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_922"> <id>1127</id> <edge_type>1</edge_type> <source_obj>572</source_obj> <sink_obj>244</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_923"> <id>1128</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_924"> <id>1129</id> <edge_type>2</edge_type> <source_obj>280</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_925"> <id>1130</id> <edge_type>2</edge_type> <source_obj>291</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_926"> <id>1131</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>247</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_927"> <id>1132</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>248</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_928"> <id>1133</id> <edge_type>1</edge_type> <source_obj>247</source_obj> <sink_obj>249</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_929"> <id>1134</id> <edge_type>1</edge_type> <source_obj>248</source_obj> <sink_obj>249</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_930"> <id>1135</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>250</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_931"> <id>1136</id> <edge_type>1</edge_type> <source_obj>890</source_obj> <sink_obj>251</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_932"> <id>1137</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>251</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_933"> <id>1139</id> <edge_type>1</edge_type> <source_obj>251</source_obj> <sink_obj>252</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_934"> <id>1140</id> <edge_type>1</edge_type> <source_obj>896</source_obj> <sink_obj>252</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_935"> <id>1141</id> <edge_type>1</edge_type> <source_obj>604</source_obj> <sink_obj>252</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_936"> <id>1142</id> <edge_type>1</edge_type> <source_obj>252</source_obj> <sink_obj>253</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_937"> <id>1143</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>254</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_938"> <id>1144</id> <edge_type>1</edge_type> <source_obj>901</source_obj> <sink_obj>254</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_939"> <id>1145</id> <edge_type>1</edge_type> <source_obj>251</source_obj> <sink_obj>255</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_940"> <id>1147</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_941"> <id>1148</id> <edge_type>1</edge_type> <source_obj>907</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_942"> <id>1149</id> <edge_type>1</edge_type> <source_obj>680</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_943"> <id>1150</id> <edge_type>1</edge_type> <source_obj>910</source_obj> <sink_obj>257</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_944"> <id>1151</id> <edge_type>1</edge_type> <source_obj>255</source_obj> <sink_obj>257</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_945"> <id>1152</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>258</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_946"> <id>1153</id> <edge_type>1</edge_type> <source_obj>255</source_obj> <sink_obj>258</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_947"> <id>1154</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_948"> <id>1155</id> <edge_type>1</edge_type> <source_obj>255</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_949"> <id>1156</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_950"> <id>1157</id> <edge_type>1</edge_type> <source_obj>257</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_951"> <id>1158</id> <edge_type>1</edge_type> <source_obj>259</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_952"> <id>1159</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>261</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_953"> <id>1160</id> <edge_type>1</edge_type> <source_obj>256</source_obj> <sink_obj>261</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_954"> <id>1161</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>261</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_955"> <id>1162</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_956"> <id>1163</id> <edge_type>1</edge_type> <source_obj>258</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_957"> <id>1164</id> <edge_type>1</edge_type> <source_obj>255</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_958"> <id>1165</id> <edge_type>1</edge_type> <source_obj>913</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_959"> <id>1166</id> <edge_type>1</edge_type> <source_obj>260</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_960"> <id>1167</id> <edge_type>1</edge_type> <source_obj>262</source_obj> <sink_obj>264</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_961"> <id>1168</id> <edge_type>1</edge_type> <source_obj>263</source_obj> <sink_obj>265</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_962"> <id>1169</id> <edge_type>1</edge_type> <source_obj>261</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_963"> <id>1170</id> <edge_type>1</edge_type> <source_obj>264</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_964"> <id>1171</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_965"> <id>1172</id> <edge_type>1</edge_type> <source_obj>265</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_966"> <id>1173</id> <edge_type>1</edge_type> <source_obj>266</source_obj> <sink_obj>268</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_967"> <id>1174</id> <edge_type>1</edge_type> <source_obj>267</source_obj> <sink_obj>268</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_968"> <id>1175</id> <edge_type>1</edge_type> <source_obj>938</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_969"> <id>1176</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_970"> <id>1177</id> <edge_type>1</edge_type> <source_obj>269</source_obj> <sink_obj>270</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_971"> <id>1178</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>271</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_972"> <id>1179</id> <edge_type>1</edge_type> <source_obj>270</source_obj> <sink_obj>271</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_973"> <id>1180</id> <edge_type>1</edge_type> <source_obj>271</source_obj> <sink_obj>272</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_974"> <id>1181</id> <edge_type>1</edge_type> <source_obj>933</source_obj> <sink_obj>272</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_975"> <id>1182</id> <edge_type>1</edge_type> <source_obj>237</source_obj> <sink_obj>273</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_976"> <id>1183</id> <edge_type>1</edge_type> <source_obj>272</source_obj> <sink_obj>273</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_977"> <id>1184</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>274</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_978"> <id>1185</id> <edge_type>1</edge_type> <source_obj>271</source_obj> <sink_obj>274</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_979"> <id>1186</id> <edge_type>1</edge_type> <source_obj>273</source_obj> <sink_obj>275</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_980"> <id>1187</id> <edge_type>1</edge_type> <source_obj>274</source_obj> <sink_obj>275</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_981"> <id>1188</id> <edge_type>1</edge_type> <source_obj>249</source_obj> <sink_obj>276</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_982"> <id>1190</id> <edge_type>1</edge_type> <source_obj>1189</source_obj> <sink_obj>276</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_983"> <id>1191</id> <edge_type>1</edge_type> <source_obj>247</source_obj> <sink_obj>277</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_984"> <id>1192</id> <edge_type>1</edge_type> <source_obj>248</source_obj> <sink_obj>277</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_985"> <id>1193</id> <edge_type>1</edge_type> <source_obj>276</source_obj> <sink_obj>278</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_986"> <id>1194</id> <edge_type>1</edge_type> <source_obj>277</source_obj> <sink_obj>278</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_987"> <id>1195</id> <edge_type>1</edge_type> <source_obj>278</source_obj> <sink_obj>279</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_988"> <id>1196</id> <edge_type>2</edge_type> <source_obj>283</source_obj> <sink_obj>279</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_989"> <id>1197</id> <edge_type>2</edge_type> <source_obj>285</source_obj> <sink_obj>279</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_990"> <id>1199</id> <edge_type>1</edge_type> <source_obj>1198</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_991"> <id>1200</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_992"> <id>1201</id> <edge_type>2</edge_type> <source_obj>285</source_obj> <sink_obj>282</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_993"> <id>1202</id> <edge_type>2</edge_type> <source_obj>291</source_obj> <sink_obj>284</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_994"> <id>1203</id> <edge_type>1</edge_type> <source_obj>237</source_obj> <sink_obj>286</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_995"> <id>1204</id> <edge_type>2</edge_type> <source_obj>246</source_obj> <sink_obj>286</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_996"> <id>1205</id> <edge_type>1</edge_type> <source_obj>275</source_obj> <sink_obj>286</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_997"> <id>1206</id> <edge_type>2</edge_type> <source_obj>285</source_obj> <sink_obj>286</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_998"> <id>1207</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>287</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_999"> <id>1209</id> <edge_type>1</edge_type> <source_obj>1208</source_obj> <sink_obj>287</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1000"> <id>1210</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>288</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1001"> <id>1211</id> <edge_type>1</edge_type> <source_obj>758</source_obj> <sink_obj>288</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1002"> <id>1212</id> <edge_type>1</edge_type> <source_obj>287</source_obj> <sink_obj>289</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1003"> <id>1213</id> <edge_type>1</edge_type> <source_obj>288</source_obj> <sink_obj>289</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1004"> <id>1214</id> <edge_type>1</edge_type> <source_obj>876</source_obj> <sink_obj>289</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1005"> <id>1215</id> <edge_type>2</edge_type> <source_obj>296</source_obj> <sink_obj>290</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1006"> <id>1216</id> <edge_type>1</edge_type> <source_obj>286</source_obj> <sink_obj>292</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1007"> <id>1217</id> <edge_type>2</edge_type> <source_obj>291</source_obj> <sink_obj>292</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1008"> <id>1218</id> <edge_type>1</edge_type> <source_obj>237</source_obj> <sink_obj>292</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1009"> <id>1219</id> <edge_type>2</edge_type> <source_obj>243</source_obj> <sink_obj>292</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1010"> <id>1220</id> <edge_type>1</edge_type> <source_obj>289</source_obj> <sink_obj>293</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1011"> <id>1221</id> <edge_type>2</edge_type> <source_obj>291</source_obj> <sink_obj>293</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1012"> <id>1222</id> <edge_type>1</edge_type> <source_obj>876</source_obj> <sink_obj>293</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1013"> <id>1223</id> <edge_type>2</edge_type> <source_obj>243</source_obj> <sink_obj>293</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1014"> <id>1224</id> <edge_type>1</edge_type> <source_obj>293</source_obj> <sink_obj>294</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1015"> <id>1225</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>294</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1016"> <id>1226</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>295</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1017"> <id>1227</id> <edge_type>1</edge_type> <source_obj>1198</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1018"> <id>1228</id> <edge_type>2</edge_type> <source_obj>395</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1019"> <id>1230</id> <edge_type>1</edge_type> <source_obj>1229</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1020"> <id>1231</id> <edge_type>2</edge_type> <source_obj>311</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1021"> <id>1232</id> <edge_type>1</edge_type> <source_obj>1198</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1022"> <id>1233</id> <edge_type>2</edge_type> <source_obj>296</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1023"> <id>1234</id> <edge_type>1</edge_type> <source_obj>1229</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1024"> <id>1235</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>396</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1025"> <id>1236</id> <edge_type>1</edge_type> <source_obj>388</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1026"> <id>1237</id> <edge_type>2</edge_type> <source_obj>395</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1027"> <id>1239</id> <edge_type>1</edge_type> <source_obj>1238</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1028"> <id>1240</id> <edge_type>2</edge_type> <source_obj>311</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1029"> <id>1241</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1030"> <id>1242</id> <edge_type>2</edge_type> <source_obj>296</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1031"> <id>1243</id> <edge_type>1</edge_type> <source_obj>1238</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1032"> <id>1244</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>397</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1033"> <id>1245</id> <edge_type>1</edge_type> <source_obj>396</source_obj> <sink_obj>398</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1034"> <id>1246</id> <edge_type>2</edge_type> <source_obj>404</source_obj> <sink_obj>398</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1035"> <id>1247</id> <edge_type>2</edge_type> <source_obj>402</source_obj> <sink_obj>398</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1036"> <id>1248</id> <edge_type>2</edge_type> <source_obj>451</source_obj> <sink_obj>437</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1037"> <id>1249</id> <edge_type>2</edge_type> <source_obj>482</source_obj> <sink_obj>450</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1038"> <id>1250</id> <edge_type>2</edge_type> <source_obj>502</source_obj> <sink_obj>481</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1039"> <id>1251</id> <edge_type>2</edge_type> <source_obj>518</source_obj> <sink_obj>501</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1040"> <id>1252</id> <edge_type>2</edge_type> <source_obj>520</source_obj> <sink_obj>517</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1041"> <id>1253</id> <edge_type>2</edge_type> <source_obj>527</source_obj> <sink_obj>519</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1042"> <id>1255</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>521</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1043"> <id>1256</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>521</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1044"> <id>1257</id> <edge_type>1</edge_type> <source_obj>1229</source_obj> <sink_obj>522</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1045"> <id>1258</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>522</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1046"> <id>1259</id> <edge_type>1</edge_type> <source_obj>561</source_obj> <sink_obj>523</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1047"> <id>1260</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>523</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1048"> <id>1261</id> <edge_type>2</edge_type> <source_obj>527</source_obj> <sink_obj>524</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1049"> <id>1262</id> <edge_type>1</edge_type> <source_obj>397</source_obj> <sink_obj>400</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1050"> <id>1263</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>400</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1051"> <id>1264</id> <edge_type>2</edge_type> <source_obj>404</source_obj> <sink_obj>401</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1052"> <id>1265</id> <edge_type>2</edge_type> <source_obj>438</source_obj> <sink_obj>403</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1053"> <id>4065</id> <edge_type>2</edge_type> <source_obj>167</source_obj> <sink_obj>525</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1054"> <id>4066</id> <edge_type>2</edge_type> <source_obj>167</source_obj> <sink_obj>170</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1055"> <id>4067</id> <edge_type>2</edge_type> <source_obj>170</source_obj> <sink_obj>184</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1056"> <id>4068</id> <edge_type>2</edge_type> <source_obj>170</source_obj> <sink_obj>520</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1057"> <id>4069</id> <edge_type>2</edge_type> <source_obj>184</source_obj> <sink_obj>516</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1058"> <id>4070</id> <edge_type>2</edge_type> <source_obj>184</source_obj> <sink_obj>188</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1059"> <id>4071</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>500</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1060"> <id>4072</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1061"> <id>4073</id> <edge_type>2</edge_type> <source_obj>191</source_obj> <sink_obj>454</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1062"> <id>4074</id> <edge_type>2</edge_type> <source_obj>191</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1063"> <id>4075</id> <edge_type>2</edge_type> <source_obj>194</source_obj> <sink_obj>449</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1064"> <id>4076</id> <edge_type>2</edge_type> <source_obj>194</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1065"> <id>4077</id> <edge_type>2</edge_type> <source_obj>198</source_obj> <sink_obj>407</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1066"> <id>4078</id> <edge_type>2</edge_type> <source_obj>198</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1067"> <id>4079</id> <edge_type>2</edge_type> <source_obj>201</source_obj> <sink_obj>300</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1068"> <id>4080</id> <edge_type>2</edge_type> <source_obj>201</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1069"> <id>4081</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>240</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1070"> <id>4082</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>399</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1071"> <id>4083</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>246</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1072"> <id>4084</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>243</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1073"> <id>4085</id> <edge_type>2</edge_type> <source_obj>243</source_obj> <sink_obj>296</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1074"> <id>4086</id> <edge_type>2</edge_type> <source_obj>246</source_obj> <sink_obj>291</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1075"> <id>4087</id> <edge_type>2</edge_type> <source_obj>246</source_obj> <sink_obj>280</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1076"> <id>4088</id> <edge_type>2</edge_type> <source_obj>280</source_obj> <sink_obj>285</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1077"> <id>4089</id> <edge_type>2</edge_type> <source_obj>280</source_obj> <sink_obj>283</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1078"> <id>4090</id> <edge_type>2</edge_type> <source_obj>283</source_obj> <sink_obj>285</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1079"> <id>4091</id> <edge_type>2</edge_type> <source_obj>285</source_obj> <sink_obj>291</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1080"> <id>4092</id> <edge_type>2</edge_type> <source_obj>291</source_obj> <sink_obj>296</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1081"> <id>4093</id> <edge_type>2</edge_type> <source_obj>296</source_obj> <sink_obj>399</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1082"> <id>4094</id> <edge_type>2</edge_type> <source_obj>300</source_obj> <sink_obj>329</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1083"> <id>4095</id> <edge_type>2</edge_type> <source_obj>300</source_obj> <sink_obj>305</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1084"> <id>4096</id> <edge_type>2</edge_type> <source_obj>305</source_obj> <sink_obj>309</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1085"> <id>4097</id> <edge_type>2</edge_type> <source_obj>305</source_obj> <sink_obj>311</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1086"> <id>4098</id> <edge_type>2</edge_type> <source_obj>309</source_obj> <sink_obj>311</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1087"> <id>4099</id> <edge_type>2</edge_type> <source_obj>311</source_obj> <sink_obj>399</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1088"> <id>4100</id> <edge_type>2</edge_type> <source_obj>329</source_obj> <sink_obj>387</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1089"> <id>4101</id> <edge_type>2</edge_type> <source_obj>329</source_obj> <sink_obj>358</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1090"> <id>4102</id> <edge_type>2</edge_type> <source_obj>358</source_obj> <sink_obj>395</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1091"> <id>4103</id> <edge_type>2</edge_type> <source_obj>387</source_obj> <sink_obj>395</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1092"> <id>4104</id> <edge_type>2</edge_type> <source_obj>395</source_obj> <sink_obj>399</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1093"> <id>4105</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>402</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1094"> <id>4106</id> <edge_type>2</edge_type> <source_obj>399</source_obj> <sink_obj>404</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1095"> <id>4107</id> <edge_type>2</edge_type> <source_obj>402</source_obj> <sink_obj>404</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1096"> <id>4108</id> <edge_type>2</edge_type> <source_obj>404</source_obj> <sink_obj>438</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1097"> <id>4109</id> <edge_type>2</edge_type> <source_obj>407</source_obj> <sink_obj>431</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1098"> <id>4110</id> <edge_type>2</edge_type> <source_obj>407</source_obj> <sink_obj>411</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1099"> <id>4111</id> <edge_type>2</edge_type> <source_obj>411</source_obj> <sink_obj>424</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1100"> <id>4112</id> <edge_type>2</edge_type> <source_obj>411</source_obj> <sink_obj>415</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1101"> <id>4113</id> <edge_type>2</edge_type> <source_obj>415</source_obj> <sink_obj>419</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1102"> <id>4114</id> <edge_type>2</edge_type> <source_obj>415</source_obj> <sink_obj>421</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1103"> <id>4115</id> <edge_type>2</edge_type> <source_obj>419</source_obj> <sink_obj>421</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1104"> <id>4116</id> <edge_type>2</edge_type> <source_obj>421</source_obj> <sink_obj>426</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1105"> <id>4117</id> <edge_type>2</edge_type> <source_obj>424</source_obj> <sink_obj>426</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1106"> <id>4118</id> <edge_type>2</edge_type> <source_obj>426</source_obj> <sink_obj>436</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1107"> <id>4119</id> <edge_type>2</edge_type> <source_obj>431</source_obj> <sink_obj>436</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1108"> <id>4120</id> <edge_type>2</edge_type> <source_obj>436</source_obj> <sink_obj>438</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1109"> <id>4121</id> <edge_type>2</edge_type> <source_obj>438</source_obj> <sink_obj>451</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1110"> <id>4122</id> <edge_type>2</edge_type> <source_obj>449</source_obj> <sink_obj>451</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1111"> <id>4123</id> <edge_type>2</edge_type> <source_obj>451</source_obj> <sink_obj>482</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1112"> <id>4124</id> <edge_type>2</edge_type> <source_obj>454</source_obj> <sink_obj>478</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1113"> <id>4125</id> <edge_type>2</edge_type> <source_obj>454</source_obj> <sink_obj>459</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1114"> <id>4126</id> <edge_type>2</edge_type> <source_obj>459</source_obj> <sink_obj>473</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1115"> <id>4127</id> <edge_type>2</edge_type> <source_obj>459</source_obj> <sink_obj>462</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1116"> <id>4128</id> <edge_type>2</edge_type> <source_obj>462</source_obj> <sink_obj>465</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1117"> <id>4129</id> <edge_type>2</edge_type> <source_obj>462</source_obj> <sink_obj>467</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1118"> <id>4130</id> <edge_type>2</edge_type> <source_obj>465</source_obj> <sink_obj>467</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1119"> <id>4131</id> <edge_type>2</edge_type> <source_obj>467</source_obj> <sink_obj>475</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1120"> <id>4132</id> <edge_type>2</edge_type> <source_obj>473</source_obj> <sink_obj>475</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1121"> <id>4133</id> <edge_type>2</edge_type> <source_obj>475</source_obj> <sink_obj>480</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1122"> <id>4134</id> <edge_type>2</edge_type> <source_obj>478</source_obj> <sink_obj>480</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1123"> <id>4135</id> <edge_type>2</edge_type> <source_obj>480</source_obj> <sink_obj>482</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1124"> <id>4136</id> <edge_type>2</edge_type> <source_obj>482</source_obj> <sink_obj>502</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1125"> <id>4137</id> <edge_type>2</edge_type> <source_obj>500</source_obj> <sink_obj>502</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1126"> <id>4138</id> <edge_type>2</edge_type> <source_obj>502</source_obj> <sink_obj>518</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1127"> <id>4139</id> <edge_type>2</edge_type> <source_obj>516</source_obj> <sink_obj>518</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1128"> <id>4140</id> <edge_type>2</edge_type> <source_obj>518</source_obj> <sink_obj>520</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1129"> <id>4141</id> <edge_type>2</edge_type> <source_obj>520</source_obj> <sink_obj>527</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1130"> <id>4142</id> <edge_type>2</edge_type> <source_obj>525</source_obj> <sink_obj>527</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1131"> <id>4143</id> <edge_type>4</edge_type> <source_obj>163</source_obj> <sink_obj>522</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1132"> <id>4144</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>523</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1133"> <id>4145</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>514</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1134"> <id>4146</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>498</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1135"> <id>4147</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>476</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1136"> <id>4148</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>447</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1137"> <id>4149</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>471</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1138"> <id>4150</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>463</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1139"> <id>4151</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>428</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1140"> <id>4152</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>422</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1141"> <id>4153</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>417</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1142"> <id>4154</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>307</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1143"> <id>4155</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1144"> <id>4156</id> <edge_type>4</edge_type> <source_obj>165</source_obj> <sink_obj>400</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1145"> <id>4157</id> <edge_type>4</edge_type> <source_obj>164</source_obj> <sink_obj>393</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1146"> <id>4158</id> <edge_type>4</edge_type> <source_obj>163</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1147"> <id>4159</id> <edge_type>4</edge_type> <source_obj>168</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1148"> <id>4160</id> <edge_type>4</edge_type> <source_obj>175</source_obj> <sink_obj>506</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1149"> <id>4161</id> <edge_type>4</edge_type> <source_obj>176</source_obj> <sink_obj>508</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1150"> <id>4162</id> <edge_type>4</edge_type> <source_obj>177</source_obj> <sink_obj>509</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1151"> <id>4163</id> <edge_type>4</edge_type> <source_obj>178</source_obj> <sink_obj>511</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1152"> <id>4164</id> <edge_type>4</edge_type> <source_obj>179</source_obj> <sink_obj>513</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1153"> <id>4165</id> <edge_type>4</edge_type> <source_obj>175</source_obj> <sink_obj>496</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1154"> <id>4166</id> <edge_type>4</edge_type> <source_obj>177</source_obj> <sink_obj>434</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1155"> <id>4167</id> <edge_type>4</edge_type> <source_obj>177</source_obj> <sink_obj>306</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1156"> <id>4168</id> <edge_type>4</edge_type> <source_obj>177</source_obj> <sink_obj>391</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1157"> <id>4169</id> <edge_type>4</edge_type> <source_obj>186</source_obj> <sink_obj>489</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1158"> <id>4170</id> <edge_type>4</edge_type> <source_obj>186</source_obj> <sink_obj>443</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1159"> <id>4171</id> <edge_type>4</edge_type> <source_obj>186</source_obj> <sink_obj>326</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1160"> <id>4172</id> <edge_type>4</edge_type> <source_obj>186</source_obj> <sink_obj>294</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1161"> <id>4173</id> <edge_type>4</edge_type> <source_obj>196</source_obj> <sink_obj>429</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1162"> <id>4174</id> <edge_type>4</edge_type> <source_obj>196</source_obj> <sink_obj>316</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_1163"> <mId>1</mId> <mTag>bp_f1244</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>57</count> <item_version>0</item_version> <item>167</item> <item>170</item> <item>184</item> <item>188</item> <item>191</item> <item>194</item> <item>198</item> <item>201</item> <item>204</item> <item>240</item> <item>243</item> <item>246</item> <item>280</item> <item>283</item> <item>285</item> <item>291</item> <item>296</item> <item>300</item> <item>305</item> <item>309</item> <item>311</item> <item>329</item> <item>358</item> <item>387</item> <item>395</item> <item>399</item> <item>402</item> <item>404</item> <item>407</item> <item>411</item> <item>415</item> <item>419</item> <item>421</item> <item>424</item> <item>426</item> <item>431</item> <item>436</item> <item>438</item> <item>449</item> <item>451</item> <item>454</item> <item>459</item> <item>462</item> <item>465</item> <item>467</item> <item>473</item> <item>475</item> <item>478</item> <item>480</item> <item>482</item> <item>500</item> <item>502</item> <item>516</item> <item>518</item> <item>520</item> <item>525</item> <item>527</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>1</mMinLatency> <mMaxLatency>1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>310</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>122</first> <second class_id="28" tracking_level="0" version="0"> <first>1</first> <second>0</second> </second> </item> <item> <first>150</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>163</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>164</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>166</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>168</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>169</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>171</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>172</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>173</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>174</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>175</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>176</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>177</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>178</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>179</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>180</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>181</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>182</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>183</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>185</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>186</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>187</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>189</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>190</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>192</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>193</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>195</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>196</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>197</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>199</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>200</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>202</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>203</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>205</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>206</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>207</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>208</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>209</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>210</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>211</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>212</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>213</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>214</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>215</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>216</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>217</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>218</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>219</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>220</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>221</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>222</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>223</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>224</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>225</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>226</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>227</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>228</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>229</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>230</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>231</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>232</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>233</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>234</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>235</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>236</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>237</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>238</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>239</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>241</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>242</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>244</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>245</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>247</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>248</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>249</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>250</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>251</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>252</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>253</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>254</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>255</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>256</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>257</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>258</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>259</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>260</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>261</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>262</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>263</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>264</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>265</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>266</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>267</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>268</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>269</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>270</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>271</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>272</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>273</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>274</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>275</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>276</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>277</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>278</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>279</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>281</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>282</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>284</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>286</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>287</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>288</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>289</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>290</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>292</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>293</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>294</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>295</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>297</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>298</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>299</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>301</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>302</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>303</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>304</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>306</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>307</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>308</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>310</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>312</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>313</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>314</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>315</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>316</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>317</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>318</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>319</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>320</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>321</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>322</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>323</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>324</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>325</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>326</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>327</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>328</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>330</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>331</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>332</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>333</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>334</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>335</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>336</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>337</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>338</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>339</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>340</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>341</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>342</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>343</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>344</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>345</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>346</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>347</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>348</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>349</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>350</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>351</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>352</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>353</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>354</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>355</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>356</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>357</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>359</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>360</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>361</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>362</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>363</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>364</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>365</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>366</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>367</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>368</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>369</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>370</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>371</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>372</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>373</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>374</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>375</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>376</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>377</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>378</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>379</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>380</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>381</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>382</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>383</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>384</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>385</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>386</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>388</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>389</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>390</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>391</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>392</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>393</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>394</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>396</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>397</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>398</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>400</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>401</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>403</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>405</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>406</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>408</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>409</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>410</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>412</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>413</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>414</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>416</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>417</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>418</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>420</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>422</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>423</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>425</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>427</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>428</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>429</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>430</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>432</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>433</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>434</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>435</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>437</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>439</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>440</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>441</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>442</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>443</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>444</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>445</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>446</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>447</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>448</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>450</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>452</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>453</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>455</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>456</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>457</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>458</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>460</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>461</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>463</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>464</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>466</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>468</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>469</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>470</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>471</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>472</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>474</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>476</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>477</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>479</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>481</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>483</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>484</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>485</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>486</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>487</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>488</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>489</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>490</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>491</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>492</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>493</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>494</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>495</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>496</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>497</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>498</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>499</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>501</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>503</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>504</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>505</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>506</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>507</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>508</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>509</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>510</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>511</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>512</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>513</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>514</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>515</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>517</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>519</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>521</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>522</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>523</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>524</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>526</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>57</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>167</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> <item> <first>170</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>184</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>188</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>191</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>194</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>198</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>201</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>204</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>240</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>243</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>246</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>280</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>283</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>285</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>291</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>296</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>300</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>305</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>309</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>311</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>329</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>358</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>387</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>395</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>399</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>402</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>404</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>407</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>411</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>415</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>419</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>421</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>424</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>426</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>431</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>436</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>438</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>449</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>451</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>454</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>459</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>462</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>465</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>467</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>473</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>475</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>478</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>480</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>482</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>500</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>502</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>516</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>518</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>520</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>525</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>527</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="1" version="0" object_id="_1164"> <region_name>bp_f1244</region_name> <basic_blocks> <count>57</count> <item_version>0</item_version> <item>167</item> <item>170</item> <item>184</item> <item>188</item> <item>191</item> <item>194</item> <item>198</item> <item>201</item> <item>204</item> <item>240</item> <item>243</item> <item>246</item> <item>280</item> <item>283</item> <item>285</item> <item>291</item> <item>296</item> <item>300</item> <item>305</item> <item>309</item> <item>311</item> <item>329</item> <item>358</item> <item>387</item> <item>395</item> <item>399</item> <item>402</item> <item>404</item> <item>407</item> <item>411</item> <item>415</item> <item>419</item> <item>421</item> <item>424</item> <item>426</item> <item>431</item> <item>436</item> <item>438</item> <item>449</item> <item>451</item> <item>454</item> <item>459</item> <item>462</item> <item>465</item> <item>467</item> <item>473</item> <item>475</item> <item>478</item> <item>480</item> <item>482</item> <item>500</item> <item>502</item> <item>516</item> <item>518</item> <item>520</item> <item>525</item> <item>527</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>2</pipe_depth> </item> </regions> <dp_fu_nodes class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="38" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

27.725904

102

0.607031

38d020ae5f39e6c696968ddf0af76185858f07f2

584

adb

Ada

tests/items-test_data.adb

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

80

2017-04-08T23:14:07.000Z

2022-02-10T22:30:51.000Z

tests/items-test_data.adb

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

89

2017-06-24T08:18:26.000Z

2021-11-12T04:37:36.000Z

tests/items-test_data.adb

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

9

2018-04-14T16:37:25.000Z

2020-03-21T14:33:49.000Z

-- This package is intended to set up and tear down the test environment. -- Once created by GNATtest, this package will never be overwritten -- automatically. Contents of this package can be modified in any way -- except for sections surrounded by a 'read only' marker. package body Items.Test_Data is procedure Set_Up(Gnattest_T: in out Test) is pragma Unreferenced(Gnattest_T); begin null; end Set_Up; procedure Tear_Down(Gnattest_T: in out Test) is pragma Unreferenced(Gnattest_T); begin null; end Tear_Down; end Items.Test_Data;

29.2

75

0.726027

a07cc82d9801bf35be769e220f6928d8a144d3e9

769

adb

Ada

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/exec_changed/second.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/exec_changed/second.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/exec_changed/second.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2005, 2007, 2008 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- 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 -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. procedure Second is begin null; end Second;

38.45

73

0.737321

383c82078ff454bc8f8256ec4f870864987adee8

7,860

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-vxworks-ppc-kernel.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-vxworks-ppc-kernel.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-vxworks-ppc-kernel.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (VxWorks 6 Kernel Version PPC) -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ package System is pragma Pure; -- Note that we take advantage of the implementation permission to make -- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada -- 2005, this is Pure in any case (AI-362). pragma No_Elaboration_Code_All; -- Allow the use of that restriction in units that WITH this unit type Name is (SYSTEM_NAME_GNAT); System_Name : constant Name := SYSTEM_NAME_GNAT; -- System-Dependent Named Numbers Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1); Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1; Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size; Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1; Max_Base_Digits : constant := Long_Long_Float'Digits; Max_Digits : constant := Long_Long_Float'Digits; Max_Mantissa : constant := 63; Fine_Delta : constant := 2.0 ** (-Max_Mantissa); Tick : constant := 1.0 / 60.0; -- Storage-related Declarations type Address is private; pragma Preelaborable_Initialization (Address); Null_Address : constant Address; Storage_Unit : constant := 8; Word_Size : constant := 32; Memory_Size : constant := 2 ** 32; -- Address comparison function "<" (Left, Right : Address) return Boolean; function "<=" (Left, Right : Address) return Boolean; function ">" (Left, Right : Address) return Boolean; function ">=" (Left, Right : Address) return Boolean; function "=" (Left, Right : Address) return Boolean; pragma Import (Intrinsic, "<"); pragma Import (Intrinsic, "<="); pragma Import (Intrinsic, ">"); pragma Import (Intrinsic, ">="); pragma Import (Intrinsic, "="); -- Other System-Dependent Declarations type Bit_Order is (High_Order_First, Low_Order_First); Default_Bit_Order : constant Bit_Order := High_Order_First; pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning -- Priority-related Declarations (RM D.1) -- Ada priorities are mapped to VxWorks priorities using the following -- transformation: 255 - Ada Priority -- Ada priorities are used as follows: -- 256 is reserved for the VxWorks kernel -- 248 - 255 correspond to hardware interrupt levels 0 .. 7 -- 247 is a catchall default "interrupt" priority for signals, -- allowing higher priority than normal tasks, but lower than -- hardware priority levels. Protected Object ceilings can -- override these values. -- 246 is used by the Interrupt_Manager task Max_Priority : constant Positive := 245; Max_Interrupt_Priority : constant Positive := 255; subtype Any_Priority is Integer range 0 .. 255; subtype Priority is Any_Priority range 0 .. 245; subtype Interrupt_Priority is Any_Priority range 246 .. 255; Default_Priority : constant Priority := 122; private type Address is mod Memory_Size; Null_Address : constant Address := 0; -------------------------------------- -- System Implementation Parameters -- -------------------------------------- -- These parameters provide information about the target that is used -- by the compiler. They are in the private part of System, where they -- can be accessed using the special circuitry in the Targparm unit -- whose source should be consulted for more detailed descriptions -- of the individual switch values. Backend_Divide_Checks : constant Boolean := False; Backend_Overflow_Checks : constant Boolean := True; Command_Line_Args : constant Boolean := False; Configurable_Run_Time : constant Boolean := False; Denorm : constant Boolean := True; Duration_32_Bits : constant Boolean := False; Exit_Status_Supported : constant Boolean := True; Fractional_Fixed_Ops : constant Boolean := False; Frontend_Layout : constant Boolean := False; Machine_Overflows : constant Boolean := False; Machine_Rounds : constant Boolean := True; Preallocated_Stacks : constant Boolean := False; Signed_Zeros : constant Boolean := True; Stack_Check_Default : constant Boolean := False; Stack_Check_Probes : constant Boolean := True; Stack_Check_Limits : constant Boolean := False; Support_Aggregates : constant Boolean := True; Support_Composite_Assign : constant Boolean := True; Support_Composite_Compare : constant Boolean := True; Support_Long_Shifts : constant Boolean := True; Always_Compatible_Rep : constant Boolean := False; Suppress_Standard_Library : constant Boolean := False; Use_Ada_Main_Program_Name : constant Boolean := True; Frontend_Exceptions : constant Boolean := False; ZCX_By_Default : constant Boolean := True; Executable_Extension : constant String := ".out"; end System;

48.220859

79

0.55827

4b74dbf547502693c5601ce17d6d71c25a273309

4,210

ads

Ada

elan520-cpu_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

elan520-cpu_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

elan520-cpu_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

------------------------------------------------------------------------ -- Copyright (C) 2004-2020 by <[email protected]> -- -- -- -- This work is free. You can redistribute it and/or modify it under -- -- the terms of the Do What The Fuck You Want To Public License, -- -- Version 2, as published by Sam Hocevar. See the LICENSE file for -- -- more details. -- ------------------------------------------------------------------------ pragma License (Unrestricted); ------------------------------------------------------------------------ -- AMD Élan(tm) SC 520 embedded microprocessor -- -- MMCR -> CPU Registers -- -- -- -- reference: Register Set Manual, Chapter 4 -- ------------------------------------------------------------------------ package Elan520.CPU_Registers is --------------------------------------------------------------------- -- Elan(tm) SC520 Microcontroller Revision Id (REVID) -- -- Memory Mapped, Read only -- -- MMCR Offset 00h -- --------------------------------------------------------------------- --------------------------------------------------------------------- -- sub types for Revision_Id type CPU_Id is range 0 .. 2**8 - 1; type Stepping is range 0 .. 2**4 - 1; -- the only known constant so far, anything else is an unknown -- processor type, check out http://www.amd.com for further types PRODUCT_ID_ELAN_520 : constant CPU_Id := 2#0000_0000#; --------------------------------------------------------------------- -- Revision ID at MMCR offset 16#00# --------------------------------------------------------------------- MMCR_OFFSET_REVISION_ID : constant := 16#00#; REVISION_ID_SIZE : constant := 16; type Revision_Id is record Minor_Step : Stepping; Major_Step : Stepping; Product_Id : CPU_Id; end record; for Revision_Id use record Minor_Step at 0 range 0 .. 3; Major_Step at 0 range 4 .. 7; Product_Id at 0 range 8 .. 15; end record; for Revision_Id'Size use REVISION_ID_SIZE; --------------------------------------------------------------------- -- Am5x86(r) CPU Control (CPUCTL) -- -- Memory-Mapped, Read/Write -- -- MMCR Offset 02h -- --------------------------------------------------------------------- --------------------------------------------------------------------- -- sub types for CPU control register type CPU_Clock_Speed is (MHz_100, MHz_133); for CPU_Clock_Speed use (MHz_100 => 2#01#, MHz_133 => 2#10#); for CPU_Clock_Speed'Size use 2; DEFAULT_CPU_CLOCK_SPEED : constant CPU_Clock_Speed := MHz_100; type Cache_Write_Mode is (Write_Back, Write_Through); for Cache_Write_Mode use (Write_Back => 0, Write_Through => 1); for Cache_Write_Mode'Size use 1; DEFAULT_CACHE_WRITE_MODE : constant Cache_Write_Mode := Write_Through; --------------------------------------------------------------------- -- CPU Control at MMCR offset 16#02# --------------------------------------------------------------------- MMCR_OFFSET_CPU_CONTROL : constant := 16#02#; CPU_CONTROL_SIZE : constant := 8; type CPU_Control is record Cpu_Clk_Spd : CPU_Clock_Speed; Cache_Wr_Mode : Cache_Write_Mode; end record; for CPU_Control use record CPU_Clk_Spd at 0 range 0 .. 1; Cache_Wr_Mode at 0 range 4 .. 4; end record; for CPU_Control'Size use CPU_CONTROL_SIZE; end Elan520.CPU_Registers;

42.1

73

0.392399

134f724d7184c6fa37a3e693c8cde07705f12134

743

ads

Ada

orka_simd/src/x86/gnat/orka-simd-sse4_1-singles.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

52

2016-07-30T23:00:28.000Z

2022-02-05T11:54:55.000Z

orka_simd/src/x86/gnat/orka-simd-sse4_1-singles.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

79

2016-08-01T18:36:48.000Z

2022-02-27T12:14:20.000Z

orka_simd/src/x86/gnat/orka-simd-sse4_1-singles.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

4

2018-04-28T22:36:26.000Z

2020-11-14T23:00:29.000Z

-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2016 onox <[email protected]> -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. package Orka.SIMD.SSE4_1.Singles is pragma Pure; end Orka.SIMD.SSE4_1.Singles;

37.15

76

0.732167

1e897fac8f520ef746e4b2354a72acd06edcc0a1

15,055

adb

Ada

source/amf/uml/amf-internals-uml_combined_fragments.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-uml_combined_fragments.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-uml_combined_fragments.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * 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. -- -- -- -- * Neither the name of the Vadim Godunko, IE 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. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Elements; with AMF.Internals.Element_Collections; with AMF.Internals.Helpers; with AMF.Internals.Tables.UML_Attributes; with AMF.Visitors.UML_Iterators; with AMF.Visitors.UML_Visitors; with League.Strings.Internals; with Matreshka.Internals.Strings; package body AMF.Internals.UML_Combined_Fragments is ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant UML_Combined_Fragment_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Enter_Combined_Fragment (AMF.UML.Combined_Fragments.UML_Combined_Fragment_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant UML_Combined_Fragment_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Leave_Combined_Fragment (AMF.UML.Combined_Fragments.UML_Combined_Fragment_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant UML_Combined_Fragment_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then AMF.Visitors.UML_Iterators.UML_Iterator'Class (Iterator).Visit_Combined_Fragment (Visitor, AMF.UML.Combined_Fragments.UML_Combined_Fragment_Access (Self), Control); end if; end Visit_Element; ------------------------ -- Get_Cfragment_Gate -- ------------------------ overriding function Get_Cfragment_Gate (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Gates.Collections.Set_Of_UML_Gate is begin return AMF.UML.Gates.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Cfragment_Gate (Self.Element))); end Get_Cfragment_Gate; ------------------------------ -- Get_Interaction_Operator -- ------------------------------ overriding function Get_Interaction_Operator (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.UML_Interaction_Operator_Kind is begin return AMF.Internals.Tables.UML_Attributes.Internal_Get_Interaction_Operator (Self.Element); end Get_Interaction_Operator; ------------------------------ -- Set_Interaction_Operator -- ------------------------------ overriding procedure Set_Interaction_Operator (Self : not null access UML_Combined_Fragment_Proxy; To : AMF.UML.UML_Interaction_Operator_Kind) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Interaction_Operator (Self.Element, To); end Set_Interaction_Operator; ----------------- -- Get_Operand -- ----------------- overriding function Get_Operand (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Interaction_Operands.Collections.Ordered_Set_Of_UML_Interaction_Operand is begin return AMF.UML.Interaction_Operands.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Operand (Self.Element))); end Get_Operand; ----------------- -- Get_Covered -- ----------------- overriding function Get_Covered (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Lifelines.Collections.Set_Of_UML_Lifeline is begin return AMF.UML.Lifelines.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Covered (Self.Element))); end Get_Covered; ------------------------------- -- Get_Enclosing_Interaction -- ------------------------------- overriding function Get_Enclosing_Interaction (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Interactions.UML_Interaction_Access is begin return AMF.UML.Interactions.UML_Interaction_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Enclosing_Interaction (Self.Element))); end Get_Enclosing_Interaction; ------------------------------- -- Set_Enclosing_Interaction -- ------------------------------- overriding procedure Set_Enclosing_Interaction (Self : not null access UML_Combined_Fragment_Proxy; To : AMF.UML.Interactions.UML_Interaction_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Enclosing_Interaction (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Enclosing_Interaction; --------------------------- -- Get_Enclosing_Operand -- --------------------------- overriding function Get_Enclosing_Operand (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access is begin return AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Enclosing_Operand (Self.Element))); end Get_Enclosing_Operand; --------------------------- -- Set_Enclosing_Operand -- --------------------------- overriding procedure Set_Enclosing_Operand (Self : not null access UML_Combined_Fragment_Proxy; To : AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Enclosing_Operand (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Enclosing_Operand; -------------------------- -- Get_General_Ordering -- -------------------------- overriding function Get_General_Ordering (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.General_Orderings.Collections.Set_Of_UML_General_Ordering is begin return AMF.UML.General_Orderings.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_General_Ordering (Self.Element))); end Get_General_Ordering; --------------------------- -- Get_Client_Dependency -- --------------------------- overriding function Get_Client_Dependency (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is begin return AMF.UML.Dependencies.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency (Self.Element))); end Get_Client_Dependency; ------------------------- -- Get_Name_Expression -- ------------------------- overriding function Get_Name_Expression (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access is begin return AMF.UML.String_Expressions.UML_String_Expression_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression (Self.Element))); end Get_Name_Expression; ------------------------- -- Set_Name_Expression -- ------------------------- overriding procedure Set_Name_Expression (Self : not null access UML_Combined_Fragment_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Name_Expression; ------------------- -- Get_Namespace -- ------------------- overriding function Get_Namespace (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin return AMF.UML.Namespaces.UML_Namespace_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace (Self.Element))); end Get_Namespace; ------------------------ -- Get_Qualified_Name -- ------------------------ overriding function Get_Qualified_Name (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.Optional_String is begin declare use type Matreshka.Internals.Strings.Shared_String_Access; Aux : constant Matreshka.Internals.Strings.Shared_String_Access := AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Qualified_Name; ------------------------- -- All_Owning_Packages -- ------------------------- overriding function All_Owning_Packages (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented"); raise Program_Error with "Unimplemented procedure UML_Combined_Fragment_Proxy.All_Owning_Packages"; return All_Owning_Packages (Self); end All_Owning_Packages; ----------------------------- -- Is_Distinguishable_From -- ----------------------------- overriding function Is_Distinguishable_From (Self : not null access constant UML_Combined_Fragment_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented"); raise Program_Error with "Unimplemented procedure UML_Combined_Fragment_Proxy.Is_Distinguishable_From"; return Is_Distinguishable_From (Self, N, Ns); end Is_Distinguishable_From; --------------- -- Namespace -- --------------- overriding function Namespace (Self : not null access constant UML_Combined_Fragment_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented"); raise Program_Error with "Unimplemented procedure UML_Combined_Fragment_Proxy.Namespace"; return Namespace (Self); end Namespace; end AMF.Internals.UML_Combined_Fragments;

39.722955

109

0.599336

9a5d91edeac80f35d3fe1e2541d0b4cad4927d43

12,984

adb

Ada

polynomial/spline/spline.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

30

2018-12-09T01:15:04.000Z

2022-03-20T16:14:54.000Z

polynomial/spline/spline.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

polynomial/spline/spline.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

----------------------------------------------------------------------- -- package body Spline, cubic splines -- Copyright (C) 2018 Jonathan S. Parker -- -- Permission to use, copy, modify, and/or distribute this software for any -- purpose with or without fee is hereby granted, provided that the above -- copyright notice and this permission notice appear in all copies. -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --------------------------------------------------------------------------- package body Spline is Zero : constant Real := +0.0; One : constant Real := +1.0; Two : constant Real := +2.0; Three : constant Real := +3.0; Six : constant Real := +6.0; One_Third : constant Real := One / Three; -------------------- -- Prepare_X_Data -- -------------------- procedure Prepare_X_Data (X_Stuff : out X_Structure; X_Data : in Data_Vector; I_Start : in Index := Index'first; I_Finish : in Index := Index'Last; Bound_First : in Boundary := Natural_BC; Bound_Last : in Boundary := Natural_BC) is D_1st : constant Tri.DiagonalID := Tri.DiagonalID'First; D_0 : constant Tri.DiagonalID := Tri.DiagonalID'Succ(Tri.DiagonalID'First); D_Last : constant Tri.DiagonalID := Tri.DiagonalID'Last; No_Of_Points_Minus_1 : constant Index'Base := I_Finish - I_Start; S : X_Structure renames X_Stuff; begin if No_Of_Points_Minus_1 < 3 then raise Constraint_Error with "Too few points for spline calculation"; end if; for i in I_Start .. I_Finish-1 loop S.dX(i) := X_Data(i+1) - X_Data(i); if S.dX(i) < Zero then raise Constraint_Error with "X axis points are out of order."; end if; if Abs (S.dX(i)) < Two ** (Real'Machine_Emin / 2) then raise Constraint_Error with "Points too close together on X axis."; end if; end loop; for i in I_Start .. I_Finish-1 loop S.dX_Inverse(i) := One / S.dX(i); end loop; -- We need to solve the matrix equation M*Z = V, for the vector Z. -- First initialize M and V. M is Tridiagonal. The lower diagonal -- is M(-1, .. ). The elements of the diagonal "vectors" are -- indexed by the row index the element would have in -- matrix form, so M(-1,*) starts at I_Start+1, etc. -- -- Impose a value Boundary_Value_First = Alpha*Y_dot_dot + Beta*Y_dot: -- -- (2*h_0*Beta - 6*Alpha)*C_0 + Beta*h_0*C_1 -- = -3*Boundary_Value_First + 3*Beta*(Y_1 - Y_0)/h_0. -- -- At the other end set Boundary_Value_Last = Alpha2*Y_dot_dot + Beta2*Y_dot, -- to get: -- -- (2*h_n-1*Beta2 + 6*Alpha2)*C_n + Beta2*h_n-1*C_n-1 -- = 3*Boundary_Value_Last - 3*Beta2*(Y_n - Y_n-1)/h_n-1. S.M(D_Last)(I_Start) := S.dX(I_Start) * Bound_First.Beta; S.M(D_0)(I_Start) := S.dX(I_Start) * Bound_First.Beta * Two - Six * Bound_First.Alpha; S.M(D_1st)(I_Finish) := S.dX(I_Finish-1) * Bound_Last.Beta; S.M(D_0)(I_Finish) := S.dX(I_Finish-1) * Bound_Last.Beta * Two + Six * Bound_Last.Alpha; -- Get rest of matrix M and vector V. -- Clamped and Natural_BC Spline types have the following in common. for i in I_Start+1 .. I_Finish-1 loop S.M(D_Last)(i) := S.dX(i); end loop; for i in I_Start+1 .. I_Finish-1 loop S.M(D_1st)(i) := S.dX(i-1); end loop; for i in I_Start+1 .. I_Finish-1 loop S.M(D_0)(i) := Two * (S.dX(i) + S.dX(i-1)); end loop; Tri.LU_Decompose (S.M, I_Start, I_Finish); S.I_Start := I_Start; S.I_Finish := I_Finish; S.Bound_First := Bound_First; S.Bound_Last := Bound_Last; S.Initialized := True; end Prepare_X_Data; ---------------- -- Get_Spline -- ---------------- procedure Get_Spline (Spline : out Spline_Coefficients; X_Stuff : in X_Structure; Y_Data : in Data_Vector) is dY : Data_Vector := (others => Zero); dY_Over_dX : Data_Vector := (others => Zero); I_Start : Index renames X_Stuff.I_Start; I_Finish : Index renames X_Stuff.I_Finish; S : X_Structure renames X_Stuff; F : Coefficients renames Spline.F; V, Z : Tri.Column; begin if not S.Initialized then raise Must_Call_Prepare_X_Data_First; end if; -- The Spline variable must carry info about the start and -- and end of the calculated spline. So this stuff was input -- in the call to Prepare_X_Data, placed into variable -- X_Stuff. Now it's placed in variable Spline, so that it -- it can be passed on to the interpolation procedures. It's -- complicated, but less error prone this way. Spline.I_Start := I_Start; Spline.I_Finish := I_Finish; for i in I_Start .. I_Finish-1 loop dY(i) := Y_Data(i+1) - Y_Data(i); end loop; for i in I_Start .. I_Finish-1 loop dY_Over_dX(i) := dY(i) * S.dX_Inverse(i); end loop; -- Solve the matrix equation M*Z = V for vector Z. First get V: -- -- The following boundary conditions differ in the cases of -- Natural Splines, and Clamped Splines. -- -- set Boundary_Value_First = Alpha*Y_dot_dot + Beta*Y_dot to get: -- -- (2*h_0*Beta - 6*Alpha)*C_0 + Beta*h_0*C_1 -- = -3*Boundary_Value_First + 3*Beta*(Y_1 - Y_0)/h_0. -- -- At the other end set Boundary_Value_Last = Alpha2*Y_dot_dot + Beta2*Y_dot, -- to get: -- -- (2*h_n-1*Beta2 + 6*Alpha2)*C_n + Beta2*h_n-1*C_n-1 -- = 3*Boundary_Value_Last - 3*Beta2*(Y_n - Y_n-1)/h_n-1. V(I_Start) := Three * (S.Bound_First.Beta * dY_Over_dX(I_Start) - S.Bound_First.Boundary_Val); V(I_Finish) := Three * (-S.Bound_Last.Beta * dY_Over_dX(I_Finish-1) + S.Bound_Last.Boundary_Val); -- Get rest of matrix M and vector V. -- Both clamped and Natural_BC Spline types have the following in common. for i in I_Start+1 .. I_Finish-1 loop V(i) := Three * (dY_Over_dX(i) - dY_Over_dX(i-1)); end loop; -- Solve for Z in the equation M*Z = V: -- Matrix M has been overwritten with the LU decomposition of M. Tri.Solve (Z, S.M, V, I_Start, I_Finish); -- coefficients of X**2: for i in I_Start .. I_Finish loop F(2)(i) := Z(i); end loop; -- coefficients of X**3: F(3)(I_Finish) := Zero; for i in I_Start .. I_Finish-1 loop F(3)(i) := (F(2)(i+1) - F(2)(i)) * S.dX_Inverse(i) * One_Third; end loop; -- coefficients of X**1: for i in I_Start .. I_Finish-1 loop F(1)(i) := - S.dX(i) * (F(2)(i+1) + Two * F(2)(i)) * One_Third; end loop; for i in I_Start .. I_Finish-1 loop F(1)(i) := F(1)(i) + dY_Over_dX(i); end loop; -- Following is used only for testing: F(1)(I_Finish) := F(1)(I_Finish-1) + S.dX(I_Finish-1)*(F(2)(I_Finish-1) + F(2)(I_Finish)); -- F : Coefficients renames Spline.F; -- So Spline.F is now initialized end Get_Spline; -------------- -- Value_At -- -------------- function Value_At (X : in Real; X_Data : in Data_Vector; Y_Data : in Data_Vector; Spline : in Spline_Coefficients) return Real is S, Segment : Index; Y, dX1, dX2, dX3 : Real; F : Coefficients renames Spline.F; I_Start : Index renames Spline.I_Start; I_Finish : Index renames Spline.I_Finish; begin if X > X_Data(I_Finish) or X < X_Data(I_Start) then raise Constraint_Error with "Independent variable X out of range"; end if; -- Find the spline segment associated with independent variable X. -- "Segment" is the Index of data array X_Data such that -- X_Data(Segment) <= X < X_Data(Segment+1). for Test_Segment in I_Start+1 .. I_Finish loop if X < X_Data(Test_Segment) then Segment := Test_Segment-1; exit; end if; end loop; if X = X_Data(I_Finish) then Segment := I_Finish-1; end if; -- sum the polynomial, return Y S := Segment; dX1 := X - X_Data(Segment); dX2 := dX1 * dX1; dX3 := dX1 * dX2; Y := Y_Data(S) + F(1)(S)*dX1 + F(2)(S)*dX2 + F(3)(S)*dX3; return Y; end Value_At; ------------------------- -- First_Derivative_At -- ------------------------- function First_Derivative_At (X : in Real; X_Data : in Data_Vector; Spline : in Spline_Coefficients) return Real is S, Segment : Index; dY_over_dX, dX1, dX2 : Real; F : Coefficients renames Spline.F; I_Start : Index renames Spline.I_Start; I_Finish : Index renames Spline.I_Finish; begin if X > X_Data(I_Finish) or X < X_Data(I_Start) then raise Constraint_Error with "Independent variable X out of range"; end if; -- Find the spline segment associated with independent variable X. -- "Segment" is the Index of data array X_Data such that -- X_Data(Segment) <= X < X_Data(Segment+1). for Test_Segment in I_Start+1 .. I_Finish loop if X < X_Data(Test_Segment) then Segment := Test_Segment-1; exit; end if; end loop; if X = X_Data(I_Finish) then Segment := I_Finish-1; end if; -- Integrate each polynomial segment from a1=X_Data(i) to b1=X_Data(I+1). -- y = y_1 + F_1 * (x - a1) + F_2 * (x - a1)**2 + F_3 * (x - a1)**3 -- sum the polynomial, return dY / dX S := Segment; dX1 := X - X_Data(Segment); dX2 := dX1 * dX1; dY_over_dX := F(1)(S) + Two * F(2)(S)*dX1 + Three * F(3)(S)*dX2; return dY_over_dX; end First_Derivative_At; -------------------------- -- Second_Derivative_At -- -------------------------- function Second_Derivative_At (X : in Real; X_Data : in Data_Vector; Spline : in Spline_Coefficients) return Real is S, Segment : Index; ddY, dX1 : Real; F : Coefficients renames Spline.F; I_Start : Index renames Spline.I_Start; I_Finish : Index renames Spline.I_Finish; begin -- Independent_Variable_X_Out_Of_Range: if X > X_Data(I_Finish) or X < X_Data(I_Start) then raise Constraint_Error; end if; -- Find the spline segment associated with independent variable X. -- "Segment" is the Index of data array X_Data such that -- X_Data(Segment) <= X < X_Data(Segment+1). for Test_Segment in I_Start+1 .. I_Finish loop if X < X_Data(Test_Segment) then Segment := Test_Segment-1; exit; end if; end loop; if X = X_Data(I_Finish) then Segment := I_Finish-1; end if; -- Integrate each polynomial segment from a1=X_Data(i) to b1=X_Data(I+1). -- y = y_1 + F_1 * (x - a1) + F_2 * (x - a1)**2 + F_3 * (x - a1)**3 -- sum the polynomial, return dY / dX S := Segment; dX1 := X - X_Data(Segment); ddY := Two * F(2)(S) + Six * F(3)(S)*dX1; return ddY; end Second_Derivative_At; -------------- -- Integral -- -------------- function Integral (X_Data : in Data_Vector; Y_Data : in Data_Vector; Spline : in Spline_Coefficients) return Real is Area, Segment_Area : Real; a1, b1 : Real; d1, d2, d3, d4 : Real; F : Coefficients renames Spline.F; I_Start : Index renames Spline.I_Start; I_Finish : Index renames Spline.I_Finish; Half : constant Real := +0.5; Quarter : constant Real := +0.25; begin -- Integrate each polynomial segment from a1=X_Data(i) to b1=X_Data(I+1). -- y = y_1 + F_1 * (x - a1) + F_2 * (x - a1)**2 + F_3 * (x - a1)**3 Area := Zero; for i in I_Start .. I_Finish-1 loop a1 := X_Data(i); b1 := X_Data(i+1); d1 := b1 - a1; d2 := d1 * d1; d3 := d1 * d2; d4 := d2 * d2; Segment_Area := Y_data(i) * d1 + F(1)(i) * d2 * Half + F(2)(i) * d3 * One_Third + F(3)(i) * d4 * Quarter; Area := Area + Segment_Area; end loop; return Area; end Integral; end Spline;

30.695035

83

0.565773

a0fab2c6720de84ae0de239f0f22391020e9829d

4,728

ads

Ada

src/util-strings-transforms.ads

Letractively/ada-util

e4c63b93635dc07c46e95f12ba02d18903b307b3

[ "Apache-2.0" ]

null

src/util-strings-transforms.ads

Letractively/ada-util

e4c63b93635dc07c46e95f12ba02d18903b307b3

[ "Apache-2.0" ]

null

src/util-strings-transforms.ads

Letractively/ada-util

e4c63b93635dc07c46e95f12ba02d18903b307b3

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- Util-texts -- Various Text Transformation Utilities -- Copyright (C) 2001, 2002, 2003, 2009, 2010 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Texts.Transforms; with Ada.Strings.Unbounded; with Ada.Characters.Handling; package Util.Strings.Transforms is pragma Preelaborate; use Ada.Strings.Unbounded; package TR is new Util.Texts.Transforms (Stream => Unbounded_String, Char => Character, Input => String, Put => Ada.Strings.Unbounded.Append, To_Upper => Ada.Characters.Handling.To_Upper, To_Lower => Ada.Characters.Handling.To_Lower, To_Input => Ada.Strings.Unbounded.To_String); -- Capitalize the string into the result stream. procedure Capitalize (Content : in String; Into : in out Unbounded_String) renames TR.Capitalize; function Capitalize (Content : String) return String renames TR.Capitalize; -- Translate the input string into an upper case string in the result stream. procedure To_Upper_Case (Content : in String; Into : in out Unbounded_String) renames TR.To_Upper_Case; function To_Upper_Case (Content : String) return String renames TR.To_Upper_Case; -- Translate the input string into a lower case string in the result stream. procedure To_Lower_Case (Content : in String; Into : in out Unbounded_String) renames TR.To_Lower_Case; function To_Lower_Case (Content : String) return String renames TR.To_Lower_Case; -- Write in the output stream the value as a \uNNNN encoding form. procedure To_Hex (Into : in out Unbounded_String; Value : in Character) renames TR.To_Hex; -- Escape the content into the result stream using the JavaScript -- escape rules. procedure Escape_Javascript (Content : in String; Into : in out Unbounded_String) renames TR.Escape_Java_Script; function Escape_Javascript (Content : String) return String renames TR.Escape_Java_Script; -- Escape the content into the result stream using the Java -- escape rules. procedure Escape_Java (Content : in String; Into : in out Unbounded_String) renames TR.Escape_Java; function Escape_Java (Content : String) return String renames TR.Escape_Java; -- Escape the content into the result stream using the XML -- escape rules: -- '<' -> '<' -- '>' -> '>' -- ''' -> ''' -- '&' -> '&' -- -> '&#nnn;' if Character'Pos >= 128 procedure Escape_Xml (Content : in String; Into : in out Unbounded_String) renames TR.Escape_Xml; function Escape_Xml (Content : String) return String renames TR.Escape_Xml; procedure Translate_Xml_Entity (Entity : in String; Into : in out Unbounded_String) renames TR.Translate_Xml_Entity; procedure Unescape_Xml (Content : in String; Translator : not null access procedure (Entity : in String; Into : in out Unbounded_String) := Translate_Xml_Entity'Access; Into : in out Unbounded_String) renames TR.Unescape_Xml; end Util.Strings.Transforms;

45.028571

82

0.548646

a00980f5de0f903ca2d5fb4dd5dc4ea025a87bd1

12,155

adb

Ada

src/player.adb

thomas070605/shoot-n-loot

e242d71e9fe94271fe7fd79573ab06d231564350

[ "MIT" ]

null

src/player.adb

thomas070605/shoot-n-loot

e242d71e9fe94271fe7fd79573ab06d231564350

[ "MIT" ]

null

src/player.adb

thomas070605/shoot-n-loot

e242d71e9fe94271fe7fd79573ab06d231564350

[ "MIT" ]

null

-- Shoot'n'loot -- Copyright (c) 2020 Fabien Chouteau with HAL; use HAL; with GESTE; with GESTE.Tile_Bank; with GESTE.Sprite.Animated; with GESTE_Config; with GESTE.Maths_Types; use GESTE.Maths_Types; with GESTE.Physics; with Game_Assets; with Game_Assets.Tileset; with Game_Assets.Misc_Objects; with PyGamer.Screen; with Projectile; with Monsters; with Sound; package body Player is package Item renames Game_Assets.Misc_Objects.Item; Fire_Animation : aliased constant GESTE.Sprite.Animated.Animation_Array := ((Item.P2.Tile_Id, 1), (Item.P3.Tile_Id, 1), (Item.P4.Tile_Id, 1), (Item.P5.Tile_Id, 1), (Item.P6.Tile_Id, 2), (Item.P7.Tile_Id, 2), (Item.P8.Tile_Id, 2), (Item.P9.Tile_Id, 2), (Item.P10.Tile_Id, 2), (Item.P11.Tile_Id, 2), (Item.P12.Tile_Id, 2), (Item.P13.Tile_Id, 2)); type Player_Type (Bank : not null GESTE.Tile_Bank.Const_Ref; Init_Frame : GESTE_Config.Tile_Index) is limited new GESTE.Physics.Object with record Sprite : aliased GESTE.Sprite.Animated.Instance (Bank, Init_Frame); Alive : Boolean := True; end record; Tile_Bank : aliased GESTE.Tile_Bank.Instance (Game_Assets.Tileset.Tiles'Access, GESTE.No_Collisions, Game_Assets.Palette'Access); P : aliased Player_Type (Tile_Bank'Access, Item.P1.Tile_Id); Max_Jump_Frame : constant := 1; Jumping : Boolean := False; Do_Jump : Boolean := False; Jump_Cnt : Natural := 0; Going_Left : Boolean := False; Going_Right : Boolean := False; Firing : Boolean := False; Grabing_Wall : Boolean := False; Facing_Left : Boolean := False; type Collision_Points is array (Natural range <>) of GESTE.Pix_Point; -- Bounding Box points BB_Top : constant Collision_Points := ((-1, -4), (1, -4)); BB_Bottom : constant Collision_Points := ((-1, 3), (1, 3)); BB_Left : constant Collision_Points := ((-3, 1), (-3, -1)); BB_Right : constant Collision_Points := ((2, 1), (2, -1)); Bounding_Box : constant Collision_Points := BB_Top & BB_Bottom & BB_Right & BB_Left; Left_Wall : constant Collision_Points := (0 => (-4, 1)); Right_Wall : constant Collision_Points := (0 => (4, 1)); Grounded : Boolean := False; Projs : array (1 .. 5) of Projectile.Instance (Tile_Bank'Access, Item.Bullet.Tile_Id); Show_Collision_Points : constant Boolean := False; function Collides (Points : Collision_Points) return Boolean; function Check_Monster_Collision return Boolean; -------------- -- Collides -- -------------- function Collides (Points : Collision_Points) return Boolean is X : constant Integer := Integer (P.Position.X); Y : constant Integer := Integer (P.Position.Y); begin for Pt of Points loop if Show_Collision_Points then declare Data : aliased HAL.UInt16_Array := (0 => 0); begin PyGamer.Screen.Set_Address (UInt16 (X + Pt.X), UInt16 (X + Pt.X), UInt16 (Y + Pt.Y), UInt16 (Y + Pt.Y)); PyGamer.Screen.Start_Pixel_TX; PyGamer.Screen.Push_Pixels (Data'Address, Data'Length); PyGamer.Screen.End_Pixel_TX; end; end if; if X + Pt.X not in 0 .. PyGamer.Screen.Width - 1 or else Y + Pt.Y not in 0 .. PyGamer.Screen.Height - 1 or else GESTE.Collides ((X + Pt.X, Y + Pt.Y)) then return True; end if; end loop; return False; end Collides; ----------------------------- -- Check_Monster_Collision -- ----------------------------- function Check_Monster_Collision return Boolean is X : constant Integer := Integer (P.Position.X); Y : constant Integer := Integer (P.Position.Y); begin for Pt of Bounding_Box loop if Monsters.Check_Hit ((X + Pt.X, Y + Pt.Y), Lethal => False) then return True; end if; end loop; return False; end Check_Monster_Collision; ----------- -- Spawn -- ----------- procedure Spawn is begin P.Alive := True; P.Set_Mass (Value (90.0)); P.Sprite.Flip_Vertical (False); P.Set_Speed ((0.0, 0.0)); GESTE.Add (P.Sprite'Access, 3); P.Sprite.Flip_Horizontal (True); for Prj of Projs loop Prj.Init; end loop; end Spawn; ---------- -- Move -- ---------- procedure Move (Pt : GESTE.Pix_Point) is begin P.Set_Position (GESTE.Maths_Types.Point'(Value (Pt.X), Value (Pt.Y))); P.Sprite.Move ((Integer (P.Position.X) - 4, Integer (P.Position.Y) - 4)); end Move; -------------- -- Position -- -------------- function Position return GESTE.Pix_Point is ((Integer (P.Position.X), Integer (P.Position.Y))); -------------- -- Is_Alive -- -------------- function Is_Alive return Boolean is (P.Alive); ------------ -- Update -- ------------ procedure Update is Old : constant Point := P.Position; Elapsed : constant Value := Value (1.0 / 60.0); Collision_To_Fix : Boolean; begin -- Check collision with monsters if Check_Monster_Collision then P.Sprite.Flip_Vertical (True); P.Alive := False; end if; if Going_Right then Facing_Left := False; P.Sprite.Flip_Horizontal (True); elsif Going_Left then Facing_Left := True; P.Sprite.Flip_Horizontal (False); end if; -- Lateral movements if Grounded then if Going_Right then P.Apply_Force ((14_000.0, 0.0)); elsif Going_Left then P.Apply_Force ((-14_000.0, 0.0)); else -- Friction on the floor P.Apply_Force ( (Value (Value (-2000.0) * P.Speed.X), 0.0)); end if; else if Going_Right then P.Apply_Force ((7_000.0, 0.0)); elsif Going_Left then P.Apply_Force ((-7_000.0, 0.0)); end if; end if; -- Gavity if not Grounded then P.Apply_Gravity (Value (-500.0)); end if; -- Wall grab if not Grounded and then P.Speed.Y > 0.0 -- Going down and then -- Pushing against a wall ((Collides (Right_Wall)) or else (Collides (Left_Wall))) then -- Friction against the wall P.Apply_Force ((0.0, -4_0000.0)); Grabing_Wall := True; else Grabing_Wall := False; end if; -- Jump if Do_Jump then declare Jmp_X : Value := 0.0; begin if Grabing_Wall then -- Wall jump Jmp_X := 215_000.0; if Collides (Right_Wall) then Jmp_X := -Jmp_X; end if; end if; P.Apply_Force ((Jmp_X, -900_000.0)); Grounded := False; Jumping := True; Sound.Play_Jump; end; end if; P.Step (Elapsed); Grounded := False; Collision_To_Fix := False; if P.Speed.Y < 0.0 then -- Going up if Collides (BB_Top) then Collision_To_Fix := True; -- Cannot jump after touching a roof Jump_Cnt := Max_Jump_Frame + 1; -- Touching a roof, kill vertical speed P.Set_Speed ((P.Speed.X, Value (0.0))); -- Going back to previous Y coord P.Set_Position ((P.Position.X, Old.Y)); end if; elsif P.Speed.Y > 0.0 then -- Going down if Collides (BB_Bottom) then Collision_To_Fix := True; Grounded := True; -- Can start jumping Jump_Cnt := 0; -- Touching a roof, kill vertical speed P.Set_Speed ((P.Speed.X, Value (0.0))); -- Going back to previous Y coord P.Set_Position ((P.Position.X, Old.Y)); end if; end if; if P.Speed.X > 0.0 then -- Going right if Collides (BB_Right) then Collision_To_Fix := True; -- Touching a wall, kill horizontal speed P.Set_Speed ((Value (0.0), P.Speed.Y)); -- Going back to previos X coord P.Set_Position ((Old.X, P.Position.Y)); end if; elsif P.Speed.X < 0.0 then -- Going left if Collides (BB_Left) then Collision_To_Fix := True; -- Touching a wall, kill horizontal speed P.Set_Speed ((Value (0.0), P.Speed.Y)); -- Going back to previous X coord P.Set_Position ((Old.X, P.Position.Y)); end if; end if; -- Fix the collisions, one pixel at a time while Collision_To_Fix loop Collision_To_Fix := False; if Collides (BB_Top) then Collision_To_Fix := True; -- Try a new Y coord that do not collides P.Set_Position ((P.Position.X, P.Position.Y + 1.0)); elsif Collides (BB_Bottom) then Collision_To_Fix := True; -- Try a new Y coord that do not collides P.Set_Position ((P.Position.X, P.Position.Y - 1.0)); end if; if Collides (BB_Right) then Collision_To_Fix := True; -- Try to find X coord that do not collides P.Set_Position ((P.Position.X - 1.0, P.Position.Y)); elsif Collides (BB_Left) then Collision_To_Fix := True; -- Try to find X coord that do not collides P.Set_Position ((P.Position.X + 1.0, P.Position.Y)); end if; end loop; Jumping := Jumping and not Grounded; P.Sprite.Signal_Frame; P.Sprite.Move ((Integer (P.Position.X) - 4, Integer (P.Position.Y) - 4)); if Firing then Fire_Projectile : for Proj of Projs loop if not Proj.Alive then if Facing_Left then Proj.Set_Speed ((-120.0 + P.Speed.X, 0.0)); else Proj.Set_Speed ((120.0 + P.Speed.X, 0.0)); end if; Proj.Spawn (Pos => P.Position, Time_To_Live => 2.0, Priority => 2); P.Sprite.Set_Animation (Fire_Animation'Access, Looping => False); Sound.Play_Gun; exit Fire_Projectile; end if; end loop Fire_Projectile; end if; for Proj of Projs loop Proj.Update (Elapsed); if Proj.Alive and then (Monsters.Check_Hit (Proj.Position, Lethal => True) or else GESTE.Collides (Proj.Position) ) then Proj.Remove; end if; end loop; Do_Jump := False; Going_Left := False; Going_Right := False; Firing := False; end Update; ---------- -- Jump -- ---------- procedure Jump is begin if Grounded or else Grabing_Wall or else (Jump_Cnt < Max_Jump_Frame) then Do_Jump := True; Jump_Cnt := Jump_Cnt + 1; end if; end Jump; ---------- -- Fire -- ---------- procedure Fire is begin Firing := True; end Fire; --------------- -- Move_Left -- --------------- procedure Move_Left is begin Going_Left := True; end Move_Left; ---------------- -- Move_Right -- ---------------- procedure Move_Right is begin Going_Right := True; end Move_Right; end Player;

25.861702

77

0.515755

4129c0d34a78c1c4b48e1b52991bf183790bbfd7

2,199

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/stack_usage1b.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/stack_usage1b.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/stack_usage1b.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-O -fstack-usage" } with Stack_Usage1_Pkg; use Stack_Usage1_Pkg; procedure Stack_Usage1b is A : Integer := Ident_Int (123); begin case A is when 0 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 1 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 2 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 3 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 4 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 5 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 6 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 7 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 8 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 9 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when others => null; end case; end Stack_Usage1b; -- { dg-final { scan-stack-usage "\t\[0-9\]\[0-9\]\t" { target i?86-*-* x86_64-*-* } } } -- { dg-final { cleanup-stack-usage } }

54.975

163

0.618463

1eb73dc18eed2910d4d45b7bb1045cd387d8ca32

637

ada

Ada

Task/Luhn-test-of-credit-card-numbers/Ada/luhn-test-of-credit-card-numbers.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

Task/Luhn-test-of-credit-card-numbers/Ada/luhn-test-of-credit-card-numbers.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

Task/Luhn-test-of-credit-card-numbers/Ada/luhn-test-of-credit-card-numbers.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

with Ada.Text_IO; use Ada.Text_IO; procedure luhn is function luhn_test(num : String) return Boolean is sum : Integer := 0; odd : Boolean := True; int : Integer; begin for p in reverse num'Range loop int := Integer'Value(num(p..p)); if odd then sum := sum + int; else sum := sum + (int*2 mod 10) + (int / 5); end if; odd := not odd; end loop; return (sum mod 10)=0; end luhn_test; begin put_line(Boolean'Image(luhn_test("49927398716"))); put_line(Boolean'Image(luhn_test("49927398717"))); put_line(Boolean'Image(luhn_test("1234567812345678"))); put_line(Boolean'Image(luhn_test("1234567812345670"))); end luhn;

24.5

55

0.689168

1eb7d20996e9a8451b7ed5aaabbf21614960b0e7

15,847

ads

Ada

awa/src/model/awa-audits-models.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/src/model/awa-audits-models.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/src/model/awa-audits-models.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- AWA.Audits.Models -- AWA.Audits.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-spec.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- pragma Warnings (Off); with ADO.Sessions; with ADO.Objects; with ADO.Statements; with ADO.SQL; with ADO.Schemas; with Ada.Calendar; with Ada.Containers.Vectors; with Ada.Strings.Unbounded; with Util.Beans.Objects; with Util.Beans.Basic.Lists; with AWA.Users.Models; pragma Warnings (On); package AWA.Audits.Models is pragma Style_Checks ("-mr"); type Audit_Ref is new ADO.Objects.Object_Ref with null record; type Audit_Field_Ref is new ADO.Objects.Object_Ref with null record; -- -------------------- -- The Audit table records the changes made on database on behalf of a user. -- The record indicates the database table and row, the field being updated, -- the old and new value. The old and new values are converted to a string -- and they truncated if necessary to 256 characters. -- -------------------- -- Create an object key for Audit. function Audit_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Audit from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Audit_Key (Id : in String) return ADO.Objects.Object_Key; Null_Audit : constant Audit_Ref; function "=" (Left, Right : Audit_Ref'Class) return Boolean; -- Set the audit identifier procedure Set_Id (Object : in out Audit_Ref; Value : in ADO.Identifier); -- Get the audit identifier function Get_Id (Object : in Audit_Ref) return ADO.Identifier; -- Set the date when the field was modified. procedure Set_Date (Object : in out Audit_Ref; Value : in Ada.Calendar.Time); -- Get the date when the field was modified. function Get_Date (Object : in Audit_Ref) return Ada.Calendar.Time; -- Set the old field value. procedure Set_Old_Value (Object : in out Audit_Ref; Value : in ADO.Nullable_String); procedure Set_Old_Value (Object : in out Audit_Ref; Value : in String); -- Get the old field value. function Get_Old_Value (Object : in Audit_Ref) return ADO.Nullable_String; function Get_Old_Value (Object : in Audit_Ref) return String; -- Set the new field value. procedure Set_New_Value (Object : in out Audit_Ref; Value : in ADO.Nullable_String); procedure Set_New_Value (Object : in out Audit_Ref; Value : in String); -- Get the new field value. function Get_New_Value (Object : in Audit_Ref) return ADO.Nullable_String; function Get_New_Value (Object : in Audit_Ref) return String; -- Set the database entity identifier to which the audit is associated. procedure Set_Entity_Id (Object : in out Audit_Ref; Value : in ADO.Identifier); -- Get the database entity identifier to which the audit is associated. function Get_Entity_Id (Object : in Audit_Ref) return ADO.Identifier; -- procedure Set_Field (Object : in out Audit_Ref; Value : in Integer); -- function Get_Field (Object : in Audit_Ref) return Integer; -- Set the user session under which the field was modified. procedure Set_Session (Object : in out Audit_Ref; Value : in AWA.Users.Models.Session_Ref'Class); -- Get the user session under which the field was modified. function Get_Session (Object : in Audit_Ref) return AWA.Users.Models.Session_Ref'Class; -- Set the entity type. procedure Set_Entity_Type (Object : in out Audit_Ref; Value : in ADO.Entity_Type); -- Get the entity type. function Get_Entity_Type (Object : in Audit_Ref) return ADO.Entity_Type; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Audit_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in Found if the object was found and False if it does not exist. procedure Load (Object : in out Audit_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Audit_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Audit_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Audit_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Audit_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition AUDIT_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Audit_Ref); -- Copy of the object. procedure Copy (Object : in Audit_Ref; Into : in out Audit_Ref); package Audit_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Audit_Ref, "=" => "="); subtype Audit_Vector is Audit_Vectors.Vector; procedure List (Object : in out Audit_Vector; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class); -- -------------------- -- The Audit_Field table describes -- the database field being updated. -- -------------------- -- Create an object key for Audit_Field. function Audit_Field_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Audit_Field from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Audit_Field_Key (Id : in String) return ADO.Objects.Object_Key; Null_Audit_Field : constant Audit_Field_Ref; function "=" (Left, Right : Audit_Field_Ref'Class) return Boolean; -- Set the audit field identifier. procedure Set_Id (Object : in out Audit_Field_Ref; Value : in Integer); -- Get the audit field identifier. function Get_Id (Object : in Audit_Field_Ref) return Integer; -- Set the audit field name. procedure Set_Name (Object : in out Audit_Field_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String); procedure Set_Name (Object : in out Audit_Field_Ref; Value : in String); -- Get the audit field name. function Get_Name (Object : in Audit_Field_Ref) return Ada.Strings.Unbounded.Unbounded_String; function Get_Name (Object : in Audit_Field_Ref) return String; -- Set the entity type procedure Set_Entity_Type (Object : in out Audit_Field_Ref; Value : in ADO.Entity_Type); -- Get the entity type function Get_Entity_Type (Object : in Audit_Field_Ref) return ADO.Entity_Type; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Audit_Field_Ref; Session : in out ADO.Sessions.Session'Class; Id : in Integer); -- Load the entity identified by 'Id'. -- Returns True in Found if the object was found and False if it does not exist. procedure Load (Object : in out Audit_Field_Ref; Session : in out ADO.Sessions.Session'Class; Id : in Integer; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Audit_Field_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Audit_Field_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Audit_Field_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Audit_Field_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition AUDIT_FIELD_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Audit_Field_Ref); -- Copy of the object. procedure Copy (Object : in Audit_Field_Ref; Into : in out Audit_Field_Ref); private AUDIT_NAME : aliased constant String := "awa_audit"; COL_0_1_NAME : aliased constant String := "id"; COL_1_1_NAME : aliased constant String := "date"; COL_2_1_NAME : aliased constant String := "old_value"; COL_3_1_NAME : aliased constant String := "new_value"; COL_4_1_NAME : aliased constant String := "entity_id"; COL_5_1_NAME : aliased constant String := "field"; COL_6_1_NAME : aliased constant String := "session_id"; COL_7_1_NAME : aliased constant String := "entity_type"; AUDIT_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 8, Table => AUDIT_NAME'Access, Members => ( 1 => COL_0_1_NAME'Access, 2 => COL_1_1_NAME'Access, 3 => COL_2_1_NAME'Access, 4 => COL_3_1_NAME'Access, 5 => COL_4_1_NAME'Access, 6 => COL_5_1_NAME'Access, 7 => COL_6_1_NAME'Access, 8 => COL_7_1_NAME'Access) ); AUDIT_TABLE : constant ADO.Schemas.Class_Mapping_Access := AUDIT_DEF'Access; Null_Audit : constant Audit_Ref := Audit_Ref'(ADO.Objects.Object_Ref with null record); type Audit_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => AUDIT_DEF'Access) with record Date : Ada.Calendar.Time; Old_Value : ADO.Nullable_String; New_Value : ADO.Nullable_String; Entity_Id : ADO.Identifier; Field : Integer; Session : AWA.Users.Models.Session_Ref; Entity_Type : ADO.Entity_Type; end record; type Audit_Access is access all Audit_Impl; overriding procedure Destroy (Object : access Audit_Impl); overriding procedure Find (Object : in out Audit_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Audit_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Audit_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Audit_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Audit_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Audit_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Audit_Ref'Class; Impl : out Audit_Access); AUDIT_FIELD_NAME : aliased constant String := "awa_audit_field"; COL_0_2_NAME : aliased constant String := "id"; COL_1_2_NAME : aliased constant String := "name"; COL_2_2_NAME : aliased constant String := "entity_type"; AUDIT_FIELD_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 3, Table => AUDIT_FIELD_NAME'Access, Members => ( 1 => COL_0_2_NAME'Access, 2 => COL_1_2_NAME'Access, 3 => COL_2_2_NAME'Access) ); AUDIT_FIELD_TABLE : constant ADO.Schemas.Class_Mapping_Access := AUDIT_FIELD_DEF'Access; Null_Audit_Field : constant Audit_Field_Ref := Audit_Field_Ref'(ADO.Objects.Object_Ref with null record); type Audit_Field_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_STRING, Of_Class => AUDIT_FIELD_DEF'Access) with record Name : Ada.Strings.Unbounded.Unbounded_String; Entity_Type : ADO.Entity_Type; end record; type Audit_Field_Access is access all Audit_Field_Impl; overriding procedure Destroy (Object : access Audit_Field_Impl); overriding procedure Find (Object : in out Audit_Field_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Audit_Field_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Audit_Field_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Audit_Field_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Audit_Field_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Audit_Field_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Audit_Field_Ref'Class; Impl : out Audit_Field_Access); end AWA.Audits.Models;

38.37046

94

0.624093

4bf302ded63a9b8dc7274b26f08d64de25fafe88

28,033

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-cforma.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-cforma.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-cforma.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . C O N T A I N E R S . F O R M A L _ O R D E R E D _ M A P S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2010-2015, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- ------------------------------------------------------------------------------ with Ada.Containers.Red_Black_Trees.Generic_Bounded_Operations; pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Bounded_Operations); with Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys; pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys); with System; use type System.Address; package body Ada.Containers.Formal_Ordered_Maps with SPARK_Mode => Off is ----------------------------- -- Node Access Subprograms -- ----------------------------- -- These subprograms provide a functional interface to access fields -- of a node, and a procedural interface for modifying these values. function Color (Node : Node_Type) return Ada.Containers.Red_Black_Trees.Color_Type; pragma Inline (Color); function Left_Son (Node : Node_Type) return Count_Type; pragma Inline (Left_Son); function Parent (Node : Node_Type) return Count_Type; pragma Inline (Parent); function Right_Son (Node : Node_Type) return Count_Type; pragma Inline (Right_Son); procedure Set_Color (Node : in out Node_Type; Color : Ada.Containers.Red_Black_Trees.Color_Type); pragma Inline (Set_Color); procedure Set_Left (Node : in out Node_Type; Left : Count_Type); pragma Inline (Set_Left); procedure Set_Right (Node : in out Node_Type; Right : Count_Type); pragma Inline (Set_Right); procedure Set_Parent (Node : in out Node_Type; Parent : Count_Type); pragma Inline (Set_Parent); ----------------------- -- Local Subprograms -- ----------------------- -- All need comments ??? generic with procedure Set_Element (Node : in out Node_Type); procedure Generic_Allocate (Tree : in out Tree_Types.Tree_Type'Class; Node : out Count_Type); procedure Free (Tree : in out Map; X : Count_Type); function Is_Greater_Key_Node (Left : Key_Type; Right : Node_Type) return Boolean; pragma Inline (Is_Greater_Key_Node); function Is_Less_Key_Node (Left : Key_Type; Right : Node_Type) return Boolean; pragma Inline (Is_Less_Key_Node); -------------------------- -- Local Instantiations -- -------------------------- package Tree_Operations is new Red_Black_Trees.Generic_Bounded_Operations (Tree_Types => Tree_Types, Left => Left_Son, Right => Right_Son); use Tree_Operations; package Key_Ops is new Red_Black_Trees.Generic_Bounded_Keys (Tree_Operations => Tree_Operations, Key_Type => Key_Type, Is_Less_Key_Node => Is_Less_Key_Node, Is_Greater_Key_Node => Is_Greater_Key_Node); --------- -- "=" -- --------- function "=" (Left, Right : Map) return Boolean is Lst : Count_Type; Node : Count_Type; ENode : Count_Type; begin if Length (Left) /= Length (Right) then return False; end if; if Is_Empty (Left) then return True; end if; Lst := Next (Left, Last (Left).Node); Node := First (Left).Node; while Node /= Lst loop ENode := Find (Right, Left.Nodes (Node).Key).Node; if ENode = 0 or else Left.Nodes (Node).Element /= Right.Nodes (ENode).Element then return False; end if; Node := Next (Left, Node); end loop; return True; end "="; ------------ -- Assign -- ------------ procedure Assign (Target : in out Map; Source : Map) is procedure Append_Element (Source_Node : Count_Type); procedure Append_Elements is new Tree_Operations.Generic_Iteration (Append_Element); -------------------- -- Append_Element -- -------------------- procedure Append_Element (Source_Node : Count_Type) is SN : Node_Type renames Source.Nodes (Source_Node); procedure Set_Element (Node : in out Node_Type); pragma Inline (Set_Element); function New_Node return Count_Type; pragma Inline (New_Node); procedure Insert_Post is new Key_Ops.Generic_Insert_Post (New_Node); procedure Unconditional_Insert_Sans_Hint is new Key_Ops.Generic_Unconditional_Insert (Insert_Post); procedure Unconditional_Insert_Avec_Hint is new Key_Ops.Generic_Unconditional_Insert_With_Hint (Insert_Post, Unconditional_Insert_Sans_Hint); procedure Allocate is new Generic_Allocate (Set_Element); -------------- -- New_Node -- -------------- function New_Node return Count_Type is Result : Count_Type; begin Allocate (Target, Result); return Result; end New_Node; ----------------- -- Set_Element -- ----------------- procedure Set_Element (Node : in out Node_Type) is begin Node.Key := SN.Key; Node.Element := SN.Element; end Set_Element; Target_Node : Count_Type; -- Start of processing for Append_Element begin Unconditional_Insert_Avec_Hint (Tree => Target, Hint => 0, Key => SN.Key, Node => Target_Node); end Append_Element; -- Start of processing for Assign begin if Target'Address = Source'Address then return; end if; if Target.Capacity < Length (Source) then raise Storage_Error with "not enough capacity"; -- SE or CE? ??? end if; Tree_Operations.Clear_Tree (Target); Append_Elements (Source); end Assign; ------------- -- Ceiling -- ------------- function Ceiling (Container : Map; Key : Key_Type) return Cursor is Node : constant Count_Type := Key_Ops.Ceiling (Container, Key); begin if Node = 0 then return No_Element; end if; return (Node => Node); end Ceiling; ----------- -- Clear -- ----------- procedure Clear (Container : in out Map) is begin Tree_Operations.Clear_Tree (Container); end Clear; ----------- -- Color -- ----------- function Color (Node : Node_Type) return Color_Type is begin return Node.Color; end Color; -------------- -- Contains -- -------------- function Contains (Container : Map; Key : Key_Type) return Boolean is begin return Find (Container, Key) /= No_Element; end Contains; ---------- -- Copy -- ---------- function Copy (Source : Map; Capacity : Count_Type := 0) return Map is Node : Count_Type := 1; N : Count_Type; begin if 0 < Capacity and then Capacity < Source.Capacity then raise Capacity_Error; end if; return Target : Map (Count_Type'Max (Source.Capacity, Capacity)) do if Length (Source) > 0 then Target.Length := Source.Length; Target.Root := Source.Root; Target.First := Source.First; Target.Last := Source.Last; Target.Free := Source.Free; while Node <= Source.Capacity loop Target.Nodes (Node).Element := Source.Nodes (Node).Element; Target.Nodes (Node).Key := Source.Nodes (Node).Key; Target.Nodes (Node).Parent := Source.Nodes (Node).Parent; Target.Nodes (Node).Left := Source.Nodes (Node).Left; Target.Nodes (Node).Right := Source.Nodes (Node).Right; Target.Nodes (Node).Color := Source.Nodes (Node).Color; Target.Nodes (Node).Has_Element := Source.Nodes (Node).Has_Element; Node := Node + 1; end loop; while Node <= Target.Capacity loop N := Node; Formal_Ordered_Maps.Free (Tree => Target, X => N); Node := Node + 1; end loop; end if; end return; end Copy; --------------------- -- Current_To_Last -- --------------------- function Current_To_Last (Container : Map; Current : Cursor) return Map is Curs : Cursor := First (Container); C : Map (Container.Capacity) := Copy (Container, Container.Capacity); Node : Count_Type; begin if Curs = No_Element then Clear (C); return C; elsif Current /= No_Element and not Has_Element (Container, Current) then raise Constraint_Error; else while Curs.Node /= Current.Node loop Node := Curs.Node; Delete (C, Curs); Curs := Next (Container, (Node => Node)); end loop; return C; end if; end Current_To_Last; ------------ -- Delete -- ------------ procedure Delete (Container : in out Map; Position : in out Cursor) is begin if not Has_Element (Container, Position) then raise Constraint_Error with "Position cursor of Delete has no element"; end if; pragma Assert (Vet (Container, Position.Node), "Position cursor of Delete is bad"); Tree_Operations.Delete_Node_Sans_Free (Container, Position.Node); Formal_Ordered_Maps.Free (Container, Position.Node); end Delete; procedure Delete (Container : in out Map; Key : Key_Type) is X : constant Node_Access := Key_Ops.Find (Container, Key); begin if X = 0 then raise Constraint_Error with "key not in map"; end if; Tree_Operations.Delete_Node_Sans_Free (Container, X); Formal_Ordered_Maps.Free (Container, X); end Delete; ------------------ -- Delete_First -- ------------------ procedure Delete_First (Container : in out Map) is X : constant Node_Access := First (Container).Node; begin if X /= 0 then Tree_Operations.Delete_Node_Sans_Free (Container, X); Formal_Ordered_Maps.Free (Container, X); end if; end Delete_First; ----------------- -- Delete_Last -- ----------------- procedure Delete_Last (Container : in out Map) is X : constant Node_Access := Last (Container).Node; begin if X /= 0 then Tree_Operations.Delete_Node_Sans_Free (Container, X); Formal_Ordered_Maps.Free (Container, X); end if; end Delete_Last; ------------- -- Element -- ------------- function Element (Container : Map; Position : Cursor) return Element_Type is begin if not Has_Element (Container, Position) then raise Constraint_Error with "Position cursor of function Element has no element"; end if; pragma Assert (Vet (Container, Position.Node), "Position cursor of function Element is bad"); return Container.Nodes (Position.Node).Element; end Element; function Element (Container : Map; Key : Key_Type) return Element_Type is Node : constant Node_Access := Find (Container, Key).Node; begin if Node = 0 then raise Constraint_Error with "key not in map"; end if; return Container.Nodes (Node).Element; end Element; --------------------- -- Equivalent_Keys -- --------------------- function Equivalent_Keys (Left, Right : Key_Type) return Boolean is begin if Left < Right or else Right < Left then return False; else return True; end if; end Equivalent_Keys; ------------- -- Exclude -- ------------- procedure Exclude (Container : in out Map; Key : Key_Type) is X : constant Node_Access := Key_Ops.Find (Container, Key); begin if X /= 0 then Tree_Operations.Delete_Node_Sans_Free (Container, X); Formal_Ordered_Maps.Free (Container, X); end if; end Exclude; ---------- -- Find -- ---------- function Find (Container : Map; Key : Key_Type) return Cursor is Node : constant Count_Type := Key_Ops.Find (Container, Key); begin if Node = 0 then return No_Element; end if; return (Node => Node); end Find; ----------- -- First -- ----------- function First (Container : Map) return Cursor is begin if Length (Container) = 0 then return No_Element; end if; return (Node => Container.First); end First; ------------------- -- First_Element -- ------------------- function First_Element (Container : Map) return Element_Type is begin if Is_Empty (Container) then raise Constraint_Error with "map is empty"; end if; return Container.Nodes (First (Container).Node).Element; end First_Element; --------------- -- First_Key -- --------------- function First_Key (Container : Map) return Key_Type is begin if Is_Empty (Container) then raise Constraint_Error with "map is empty"; end if; return Container.Nodes (First (Container).Node).Key; end First_Key; ----------------------- -- First_To_Previous -- ----------------------- function First_To_Previous (Container : Map; Current : Cursor) return Map is Curs : Cursor := Current; C : Map (Container.Capacity) := Copy (Container, Container.Capacity); Node : Count_Type; begin if Curs = No_Element then return C; elsif not Has_Element (Container, Curs) then raise Constraint_Error; else while Curs.Node /= 0 loop Node := Curs.Node; Delete (C, Curs); Curs := Next (Container, (Node => Node)); end loop; return C; end if; end First_To_Previous; ----------- -- Floor -- ----------- function Floor (Container : Map; Key : Key_Type) return Cursor is Node : constant Count_Type := Key_Ops.Floor (Container, Key); begin if Node = 0 then return No_Element; end if; return (Node => Node); end Floor; ---------- -- Free -- ---------- procedure Free (Tree : in out Map; X : Count_Type) is begin Tree.Nodes (X).Has_Element := False; Tree_Operations.Free (Tree, X); end Free; ---------------------- -- Generic_Allocate -- ---------------------- procedure Generic_Allocate (Tree : in out Tree_Types.Tree_Type'Class; Node : out Count_Type) is procedure Allocate is new Tree_Operations.Generic_Allocate (Set_Element); begin Allocate (Tree, Node); Tree.Nodes (Node).Has_Element := True; end Generic_Allocate; ----------------- -- Has_Element -- ----------------- function Has_Element (Container : Map; Position : Cursor) return Boolean is begin if Position.Node = 0 then return False; end if; return Container.Nodes (Position.Node).Has_Element; end Has_Element; ------------- -- Include -- ------------- procedure Include (Container : in out Map; Key : Key_Type; New_Item : Element_Type) is Position : Cursor; Inserted : Boolean; begin Insert (Container, Key, New_Item, Position, Inserted); if not Inserted then declare N : Node_Type renames Container.Nodes (Position.Node); begin N.Key := Key; N.Element := New_Item; end; end if; end Include; procedure Insert (Container : in out Map; Key : Key_Type; New_Item : Element_Type; Position : out Cursor; Inserted : out Boolean) is function New_Node return Node_Access; -- Comment ??? procedure Insert_Post is new Key_Ops.Generic_Insert_Post (New_Node); procedure Insert_Sans_Hint is new Key_Ops.Generic_Conditional_Insert (Insert_Post); -------------- -- New_Node -- -------------- function New_Node return Node_Access is procedure Initialize (Node : in out Node_Type); procedure Allocate_Node is new Generic_Allocate (Initialize); procedure Initialize (Node : in out Node_Type) is begin Node.Key := Key; Node.Element := New_Item; end Initialize; X : Node_Access; begin Allocate_Node (Container, X); return X; end New_Node; -- Start of processing for Insert begin Insert_Sans_Hint (Container, Key, Position.Node, Inserted); end Insert; procedure Insert (Container : in out Map; Key : Key_Type; New_Item : Element_Type) is Position : Cursor; Inserted : Boolean; begin Insert (Container, Key, New_Item, Position, Inserted); if not Inserted then raise Constraint_Error with "key already in map"; end if; end Insert; -------------- -- Is_Empty -- -------------- function Is_Empty (Container : Map) return Boolean is begin return Length (Container) = 0; end Is_Empty; ------------------------- -- Is_Greater_Key_Node -- ------------------------- function Is_Greater_Key_Node (Left : Key_Type; Right : Node_Type) return Boolean is begin -- k > node same as node < k return Right.Key < Left; end Is_Greater_Key_Node; ---------------------- -- Is_Less_Key_Node -- ---------------------- function Is_Less_Key_Node (Left : Key_Type; Right : Node_Type) return Boolean is begin return Left < Right.Key; end Is_Less_Key_Node; --------- -- Key -- --------- function Key (Container : Map; Position : Cursor) return Key_Type is begin if not Has_Element (Container, Position) then raise Constraint_Error with "Position cursor of function Key has no element"; end if; pragma Assert (Vet (Container, Position.Node), "Position cursor of function Key is bad"); return Container.Nodes (Position.Node).Key; end Key; ---------- -- Last -- ---------- function Last (Container : Map) return Cursor is begin if Length (Container) = 0 then return No_Element; end if; return (Node => Container.Last); end Last; ------------------ -- Last_Element -- ------------------ function Last_Element (Container : Map) return Element_Type is begin if Is_Empty (Container) then raise Constraint_Error with "map is empty"; end if; return Container.Nodes (Last (Container).Node).Element; end Last_Element; -------------- -- Last_Key -- -------------- function Last_Key (Container : Map) return Key_Type is begin if Is_Empty (Container) then raise Constraint_Error with "map is empty"; end if; return Container.Nodes (Last (Container).Node).Key; end Last_Key; -------------- -- Left_Son -- -------------- function Left_Son (Node : Node_Type) return Count_Type is begin return Node.Left; end Left_Son; ------------ -- Length -- ------------ function Length (Container : Map) return Count_Type is begin return Container.Length; end Length; ---------- -- Move -- ---------- procedure Move (Target : in out Map; Source : in out Map) is NN : Tree_Types.Nodes_Type renames Source.Nodes; X : Node_Access; begin if Target'Address = Source'Address then return; end if; if Target.Capacity < Length (Source) then raise Constraint_Error with -- ??? "Source length exceeds Target capacity"; end if; Clear (Target); loop X := First (Source).Node; exit when X = 0; -- Here we insert a copy of the source element into the target, and -- then delete the element from the source. Another possibility is -- that delete it first (and hang onto its index), then insert it. -- ??? Insert (Target, NN (X).Key, NN (X).Element); -- optimize??? Tree_Operations.Delete_Node_Sans_Free (Source, X); Formal_Ordered_Maps.Free (Source, X); end loop; end Move; ---------- -- Next -- ---------- procedure Next (Container : Map; Position : in out Cursor) is begin Position := Next (Container, Position); end Next; function Next (Container : Map; Position : Cursor) return Cursor is begin if Position = No_Element then return No_Element; end if; if not Has_Element (Container, Position) then raise Constraint_Error; end if; pragma Assert (Vet (Container, Position.Node), "bad cursor in Next"); return (Node => Tree_Operations.Next (Container, Position.Node)); end Next; ------------- -- Overlap -- ------------- function Overlap (Left, Right : Map) return Boolean is begin if Length (Left) = 0 or Length (Right) = 0 then return False; end if; declare L_Node : Count_Type := First (Left).Node; R_Node : Count_Type := First (Right).Node; L_Last : constant Count_Type := Next (Left, Last (Left).Node); R_Last : constant Count_Type := Next (Right, Last (Right).Node); begin if Left'Address = Right'Address then return True; end if; loop if L_Node = L_Last or else R_Node = R_Last then return False; end if; if Left.Nodes (L_Node).Key < Right.Nodes (R_Node).Key then L_Node := Next (Left, L_Node); elsif Right.Nodes (R_Node).Key < Left.Nodes (L_Node).Key then R_Node := Next (Right, R_Node); else return True; end if; end loop; end; end Overlap; ------------ -- Parent -- ------------ function Parent (Node : Node_Type) return Count_Type is begin return Node.Parent; end Parent; -------------- -- Previous -- -------------- procedure Previous (Container : Map; Position : in out Cursor) is begin Position := Previous (Container, Position); end Previous; function Previous (Container : Map; Position : Cursor) return Cursor is begin if Position = No_Element then return No_Element; end if; if not Has_Element (Container, Position) then raise Constraint_Error; end if; pragma Assert (Vet (Container, Position.Node), "bad cursor in Previous"); declare Node : constant Count_Type := Tree_Operations.Previous (Container, Position.Node); begin if Node = 0 then return No_Element; end if; return (Node => Node); end; end Previous; ------------- -- Replace -- ------------- procedure Replace (Container : in out Map; Key : Key_Type; New_Item : Element_Type) is begin declare Node : constant Node_Access := Key_Ops.Find (Container, Key); begin if Node = 0 then raise Constraint_Error with "key not in map"; end if; declare N : Node_Type renames Container.Nodes (Node); begin N.Key := Key; N.Element := New_Item; end; end; end Replace; --------------------- -- Replace_Element -- --------------------- procedure Replace_Element (Container : in out Map; Position : Cursor; New_Item : Element_Type) is begin if not Has_Element (Container, Position) then raise Constraint_Error with "Position cursor of Replace_Element has no element"; end if; pragma Assert (Vet (Container, Position.Node), "Position cursor of Replace_Element is bad"); Container.Nodes (Position.Node).Element := New_Item; end Replace_Element; --------------- -- Right_Son -- --------------- function Right_Son (Node : Node_Type) return Count_Type is begin return Node.Right; end Right_Son; --------------- -- Set_Color -- --------------- procedure Set_Color (Node : in out Node_Type; Color : Color_Type) is begin Node.Color := Color; end Set_Color; -------------- -- Set_Left -- -------------- procedure Set_Left (Node : in out Node_Type; Left : Count_Type) is begin Node.Left := Left; end Set_Left; ---------------- -- Set_Parent -- ---------------- procedure Set_Parent (Node : in out Node_Type; Parent : Count_Type) is begin Node.Parent := Parent; end Set_Parent; --------------- -- Set_Right -- --------------- procedure Set_Right (Node : in out Node_Type; Right : Count_Type) is begin Node.Right := Right; end Set_Right; ------------------ -- Strict_Equal -- ------------------ function Strict_Equal (Left, Right : Map) return Boolean is LNode : Count_Type := First (Left).Node; RNode : Count_Type := First (Right).Node; begin if Length (Left) /= Length (Right) then return False; end if; while LNode = RNode loop if LNode = 0 then return True; end if; if Left.Nodes (LNode).Element /= Right.Nodes (RNode).Element or else Left.Nodes (LNode).Key /= Right.Nodes (RNode).Key then exit; end if; LNode := Next (Left, LNode); RNode := Next (Right, RNode); end loop; return False; end Strict_Equal; end Ada.Containers.Formal_Ordered_Maps;

26.028784

79

0.540863

9aaf85562e2216890196d64abbc1dae6bd35a601

3,378

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/s-conca7.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/s-conca7.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/s-conca7.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . C O N C A T _ 7 -- -- -- -- S p e c -- -- -- -- Copyright (C) 2008-2013, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains a procedure for runtime concatenation of seven string -- operands. It is used when we want to save space in the generated code. pragma Compiler_Unit_Warning; package System.Concat_7 is procedure Str_Concat_7 (R : out String; S1, S2, S3, S4, S5, S6, S7 : String); -- Performs the operation R := S1 & S2 & S3 & S4 & S5 & S6 & S7. The -- bounds of R are known to be correct (usually set by a call to the -- Str_Concat_Bounds_8 procedure below), so no bounds checks are required, -- and it is known that none of the input operands overlaps R. No -- assumptions can be made about the lower bounds of any of the operands. procedure Str_Concat_Bounds_7 (Lo, Hi : out Natural; S1, S2, S3, S4, S5, S6, S7 : String); -- Assigns to Lo..Hi the bounds of the result of concatenating the seven -- given strings, following the rules in the RM regarding null operands. end System.Concat_7;

61.418182

79

0.457075

a033adcb30c2779887717008421dd71cbd8d6913

33,827

adb

Ada

src/el-expressions-parser.adb

jquorning/ada-el

b0b07da093ac6109286404cb54a62a9a93816610

[ "Apache-2.0" ]

6

2015-01-18T23:04:00.000Z

2022-01-26T12:34:07.000Z

src/el-expressions-parser.adb

jquorning/ada-el

b0b07da093ac6109286404cb54a62a9a93816610

[ "Apache-2.0" ]

1

2022-01-30T20:46:16.000Z

src/el-expressions-parser.adb

jquorning/ada-el

b0b07da093ac6109286404cb54a62a9a93816610

[ "Apache-2.0" ]

2

2021-01-06T08:27:49.000Z

2022-01-30T19:33:41.000Z

----------------------------------------------------------------------- -- el-expressions-parsers -- Parser for Expression Language -- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2018, 2019, 2021 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Characters.Conversions; with Util.Texts.Builders; with EL.Functions; package body EL.Expressions.Parser is use Ada.Characters.Conversions; use EL.Expressions.Nodes; use EL.Functions; package Wide_Builder is new Util.Texts.Builders (Element_Type => Wide_Wide_Character, Input => Wide_Wide_String, Chunk_Size => 100); function To_Wide_Wide_String (Source : in Wide_Builder.Builder) return Wide_Wide_String renames Wide_Builder.To_Array; use Wide_Builder; type Token_Type is (T_EOL, T_LEFT_PARENT, T_RIGHT_PARENT, T_LT, T_LE, T_GT, T_GE, T_NE, T_EQ, T_EMPTY, T_NOT, T_OR, T_AND, T_LOGICAL_AND, T_MINUS, T_PLUS, T_MUL, T_DIV, T_MOD, T_DOT, T_QUESTION, T_COLON, T_COMMA, T_NUMBER, T_LITERAL, T_NAME, T_TRUE, T_FALSE, T_NULL, T_BRACE_END, T_UNKNOWN); type Parser (Length : Natural) is limited record Pos : Natural; Token_Start : Natural; Token_End : Natural; Value : Long_Long_Integer; Pending_Token : Token_Type := T_EOL; Mapper : Function_Mapper_Access; Token : Wide_Builder.Builder (100); Expr : Wide_Wide_String (1 .. Length); end record; function Create_Node (Value : in Wide_Builder.Builder) return ELNode_Access; procedure Put_Back (P : in out Parser; Token : in Token_Type); -- Parse a literal or an expression procedure Parse_EL (P : in out Parser; Result : out ELNode_Access); procedure Parse_Choice (P : in out Parser; Result : out ELNode_Access); procedure Parse_Or (P : in out Parser; Result : out ELNode_Access); procedure Parse_And (P : in out Parser; Result : out ELNode_Access); procedure Parse_Equality (P : in out Parser; Result : out ELNode_Access); procedure Parse_Compare (P : in out Parser; Result : out ELNode_Access); procedure Parse_Math (P : in out Parser; Result : out ELNode_Access); procedure Parse_Multiply (P : in out Parser; Result : out ELNode_Access); procedure Parse_Unary (P : in out Parser; Result : out ELNode_Access); procedure Parse_Function (P : in out Parser; Namespace : in String; Name : in String; Result : out ELNode_Access); -- Parse the expression buffer to find the next token. procedure Peek (P : in out Parser; Token : out Token_Type); procedure Parse_Number (P : in out Parser; Result : out Long_Long_Integer); function Create_Node (Value : in Wide_Builder.Builder) return ELNode_Access is begin return Create_Node (To_Wide_Wide_String (Value)); end Create_Node; -- #{bean.name} -- #{12 + 23} -- #{bean.name + bean.name} -- #{bean.name == 2 ? 'test' : 'foo'} -- -- expr ::= expr ? expr : expr -- expr ::= expr <op> expr -- expr ::= <unary> expr -- expr ::= ( expr ) -- expr ::= expr ? expr : expr -- expr ::= name . name -- expr ::= name -- expr ::= <number> -- expr ::= <literal> -- literal ::= '...' | ".." -- number ::= [0-9]+ -- -- ------------------------------ -- Parse a literal or an expression -- ------------------------------ procedure Parse_EL (P : in out Parser; Result : out ELNode_Access) is Literal, Node : ELNode_Access; C : Wide_Wide_Character; begin scan : while P.Pos <= P.Expr'Last loop C := P.Expr (P.Pos); if C = '\' then P.Pos := P.Pos + 1; exit scan when P.Pos > P.Expr'Last; C := P.Expr (P.Pos); Append (P.Token, C); P.Pos := P.Pos + 1; elsif C = '#' or C = '$' then P.Pos := P.Pos + 1; if P.Pos > P.Expr'Last then raise Invalid_Expression with "Missing '{' to start expression"; end if; C := P.Expr (P.Pos); if C /= '{' then raise Invalid_Expression with "Missing '{' to start expression"; end if; if Length (P.Token) > 0 then if Literal /= null then Literal := Create_Node (EL_CONCAT, Literal, Create_Node (P.Token)); else Literal := Create_Node (P.Token); end if; end if; P.Pos := P.Pos + 1; Parse_Choice (P, Node); if P.Pending_Token /= T_BRACE_END then raise Invalid_Expression with "Missing '}' to close expression"; end if; P.Pending_Token := T_EOL; Clear (P.Token); if Literal /= null then Literal := Create_Node (EL_CONCAT, Literal, Node); else Literal := Node; end if; Node := null; else Append (P.Token, C); P.Pos := P.Pos + 1; end if; end loop scan; if Length (P.Token) > 0 then Node := Create_Node (P.Token); if Literal /= null then Result := Create_Node (EL_CONCAT, Literal, Node); else Result := Node; end if; else Result := Literal; end if; Node := null; Literal := null; exception when others => Delete (Result); Delete (Literal); Delete (Node); raise; end Parse_EL; -- ------------------------------ -- Parse a choice expression, then Or. -- -- choice ::= expr '?' expr ':' choice -- -- Section 1.11: Conditional Operator - A ? B : C -- ------------------------------ procedure Parse_Choice (P : in out Parser; Result : out ELNode_Access) is Left, Right : ELNode_Access; Token : Token_Type; begin Parse_Or (P, Result); Peek (P, Token); if Token /= T_QUESTION then Put_Back (P, Token); return; end if; Parse_Or (P, Left); Peek (P, Token); if Token /= T_COLON then raise Invalid_Expression with "Missing :"; end if; Parse_Choice (P, Right); Result := Create_Node (Result, Left, Right); exception when others => Delete (Result); Delete (Left); Delete (Right); raise; end Parse_Choice; -- ------------------------------ -- Parse a logical 'or' expression, then 'and' -- -- or-expr ::= and-expr || and-expr -- -- Section 1.9.1 Binary operator -- ------------------------------ procedure Parse_Or (P : in out Parser; Result : out ELNode_Access) is Token : Token_Type; Right : ELNode_Access; begin Parse_And (P, Result); loop Peek (P, Token); exit when Token /= T_OR; Parse_And (P, Right); Result := Create_Node (EL_LOR, Result, Right); Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_Or; -- ------------------------------ -- Parse a logical 'and' expression, then 'equality' -- -- and-expr ::= equ-expr && equ-expr -- -- Section 1.9.1 Binary operator -- ------------------------------ procedure Parse_And (P : in out Parser; Result : out ELNode_Access) is Token : Token_Type; Right : ELNode_Access; begin Parse_Equality (P, Result); loop Peek (P, Token); exit when Token /= T_LOGICAL_AND; Parse_Equality (P, Right); Result := Create_Node (EL_LAND, Result, Right); Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_And; -- ------------------------------ -- Parse an equality '==' 'eq' '!=' 'ne expression, then 'compare' -- -- equ-expr ::= cmp-expr '==' cmp-expr -- equ-expr ::= cmp-expr '!=' cmp-expr -- -- Section 1.8.2 Relational Operators -- ------------------------------ procedure Parse_Equality (P : in out Parser; Result : out ELNode_Access) is Token : Token_Type; Right : ELNode_Access; begin Parse_Compare (P, Result); loop Peek (P, Token); exit when Token /= T_EQ and Token /= T_NE; Parse_Equality (P, Right); if Token = T_EQ then Result := Create_Node (EL_EQ, Result, Right); else Result := Create_Node (EL_NE, Result, Right); end if; Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_Equality; -- ------------------------------ -- Parse a comparison operation then Math -- expr ::= expr '<' expr -- expr ::= expr '<=' expr -- expr ::= expr '>' expr -- expr ::= expr '=' expr -- expr ::= expr '>=' expr -- -- Section 1.8.1 Relational Operators -- ------------------------------ procedure Parse_Compare (P : in out Parser; Result : out ELNode_Access) is Right : ELNode_Access; Token : Token_Type; begin Parse_Math (P, Result); loop Peek (P, Token); case Token is when T_LT => Parse_Math (P, Right); Result := Create_Node (EL_LT, Result, Right); when T_LE => Parse_Math (P, Right); Result := Create_Node (EL_LE, Result, Right); when T_GT => Parse_Math (P, Right); Result := Create_Node (EL_GT, Result, Right); when T_GE => Parse_Math (P, Right); Result := Create_Node (EL_GE, Result, Right); when others => exit; end case; Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_Compare; -- ------------------------------ -- Parse a math expression '+' or '-' then Multiply -- expr ::= factor '+' expr -- expr ::= factor '-' expr -- expr ::= factor '&' expr -- -- Section 1.7.1 Binary operators A (+|-) B -- ------------------------------ procedure Parse_Math (P : in out Parser; Result : out ELNode_Access) is Right : ELNode_Access; Token : Token_Type; begin Parse_Multiply (P, Result); loop Peek (P, Token); case Token is when T_PLUS => Parse_Multiply (P, Right); Result := Create_Node (EL_ADD, Result, Right); when T_MINUS => Parse_Multiply (P, Right); Result := Create_Node (EL_SUB, Result, Right); when T_AND => Parse_Multiply (P, Right); Result := Create_Node (EL_AND, Result, Right); when others => exit; end case; Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_Math; -- ------------------------------ -- Parse a multiply '*' '/' '%' then Unary -- factor ::= term '*' factor -- factor ::= term '/' factor -- factor ::= term -- -- Section 1.7.1 Binary operators A * B -- Section 1.7.2 Binary operators A / B -- ------------------------------ procedure Parse_Multiply (P : in out Parser; Result : out ELNode_Access) is Token : Token_Type; Right : ELNode_Access; begin Parse_Unary (P, Result); loop Peek (P, Token); case Token is when T_MUL => Parse_Unary (P, Right); Result := Create_Node (EL_MUL, Result, Right); when T_DIV => Parse_Unary (P, Right); Result := Create_Node (EL_DIV, Result, Right); when T_MOD => Parse_Unary (P, Right); Result := Create_Node (EL_MOD, Result, Right); when others => exit; end case; Right := null; end loop; Put_Back (P, Token); exception when others => Delete (Result); Delete (Right); raise; end Parse_Multiply; -- ------------------------------ -- Parse a unary '!' '-' 'not' 'empty' then value -- unary ::= '(' choice ')' -- unary ::= ! unary -- unary ::= not unary -- unary ::= '-' unary -- term ::= '(' expr ')' -- term ::= literal -- term ::= ['-'] number ['.' number [{'e' | 'E'} number]] -- term ::= name '.' name -- number ::= [0-9]+ -- -- Section 1.9.2 Unary not operator -- Section 1.10 Empty operator -- Section 1.12 Parentheses -- Section 1.3 Literals -- ------------------------------ procedure Parse_Unary (P : in out Parser; Result : out ELNode_Access) is Token : Token_Type; Node : ELNode_Access; begin scan_unary : loop Peek (P, Token); case Token is -- Parenthesis expression when T_LEFT_PARENT => Parse_Choice (P, Result); Peek (P, Token); if Token /= T_RIGHT_PARENT then raise Invalid_Expression with "Missing ')' at end of expression"; end if; return; when T_NOT => Parse_Unary (P, Node); Result := Create_Node (EL_NOT, Node); return; when T_MINUS => Parse_Unary (P, Node); Result := Create_Node (EL_MINUS, Node); return; when T_EMPTY => Parse_Unary (P, Node); Result := Create_Node (EL_EMPTY, Node); return; when T_NUMBER => Result := Create_Node (P.Value); return; -- when T_LITERAL => Result := Create_Node (P.Token); return; when T_TRUE => Result := Create_Node (True); return; when T_FALSE => Result := Create_Node (False); return; when T_NULL => Result := Create_Node (False); return; when T_NAME => -- name -- name.name.name -- name[expr] -- name.name[expr] -- name(expr,...,expr) declare C : Wide_Wide_Character; begin if P.Pos <= P.Expr'Last then C := P.Expr (P.Pos); else C := ' '; end if; if C = '.' then Result := Create_Variable (P.Expr (P.Token_Start .. P.Token_End)); -- Parse one or several property extensions while C = '.' loop P.Pos := P.Pos + 1; Peek (P, Token); exit when Token /= T_NAME; Result := Create_Value (Variable => Result, Name => P.Expr (P.Token_Start .. P.Token_End)); if P.Pos <= P.Expr'Last then C := P.Expr (P.Pos); else C := ' '; end if; end loop; -- Parse a function call elsif C = ':' then declare Name : constant String := To_String (P.Expr (P.Token_Start .. P.Token_End)); begin P.Pos := P.Pos + 1; Peek (P, Token); if P.Pos <= P.Expr'Last then C := P.Expr (P.Pos); else C := ' '; end if; if Token /= T_NAME or C /= '(' then raise Invalid_Expression with "Missing function name after ':'"; end if; Parse_Function (P, Name, To_String (P.Expr (P.Token_Start .. P.Token_End)), Result); end; -- Parse a function call elsif C = '(' then Parse_Function (P, "", To_String (P.Expr (P.Token_Start .. P.Token_End)), Result); else Result := Create_Variable (P.Expr (P.Token_Start .. P.Token_End)); end if; -- Recognize a basic form of array index. if C = '[' then P.Pos := P.Pos + 1; Peek (P, Token); if Token = T_NAME then Result := Create_Value (Variable => Result, Name => P.Expr (P.Token_Start .. P.Token_End)); elsif Token = T_LITERAL then Result := Create_Value (Variable => Result, Name => To_Wide_Wide_String (P.Token)); else raise Invalid_Expression with "Missing string in array index []"; end if; if P.Pos > P.Expr'Last or else P.Expr (P.Pos) /= ']' then raise Invalid_Expression with "Missing ']' to close array index"; end if; P.Pos := P.Pos + 1; end if; end; return; when others => raise Invalid_Expression with "Syntax error in expression"; end case; end loop scan_unary; exception when others => Delete (Result); Delete (Node); raise; end Parse_Unary; -- ------------------------------ -- Put back a token in the buffer. -- ------------------------------ procedure Put_Back (P : in out Parser; Token : in Token_Type) is begin P.Pending_Token := Token; end Put_Back; -- ------------------------------ -- Parse the expression buffer to find the next token. -- ------------------------------ procedure Peek (P : in out Parser; Token : out Token_Type) is C, C1 : Wide_Wide_Character; begin Token := T_UNKNOWN; -- If a token was put back, return it. if P.Pending_Token /= T_EOL then Token := P.Pending_Token; P.Pending_Token := T_EOL; return; end if; -- Skip white spaces while P.Pos <= P.Expr'Last loop C := P.Expr (P.Pos); exit when C /= ' ' and C /= ' '; P.Pos := P.Pos + 1; end loop; -- Check for end of string. if P.Pos > P.Expr'Last then Token := T_EOL; return; end if; -- See what we have and continue parsing. P.Pos := P.Pos + 1; case C is -- Literal string using single or double quotes -- Collect up to the end of the string and put -- the result in the parser token result. when ''' | '"' => Clear (P.Token); while P.Pos <= P.Expr'Last loop C1 := P.Expr (P.Pos); P.Pos := P.Pos + 1; if C1 = '\' then C1 := P.Expr (P.Pos); P.Pos := P.Pos + 1; elsif C1 = C then Token := T_LITERAL; return; end if; Append (P.Token, C1); end loop; raise Invalid_Expression with "Missing ' or """; -- Number when '0' .. '9' => P.Pos := P.Pos - 1; Parse_Number (P, P.Value); if P.Pos <= P.Expr'Last then declare Decimal_Part : Long_Long_Integer := 0; begin C := P.Expr (P.Pos); if C = '.' then P.Pos := P.Pos + 1; if P.Pos <= P.Expr'Last then C := P.Expr (P.Pos); if C in '0' .. '9' then Parse_Number (P, Decimal_Part); end if; end if; end if; end; end if; Token := T_NUMBER; return; -- Parse a name composed of letters or digits. when 'a' .. 'z' | 'A' .. 'Z' => P.Token_Start := P.Pos - 1; while P.Pos <= P.Expr'Last loop C1 := P.Expr (P.Pos); exit when not (C1 in 'a' .. 'z' or C1 in 'A' .. 'Z' or C1 in '0' .. '9' or C1 = '_'); P.Pos := P.Pos + 1; end loop; P.Token_End := P.Pos - 1; -- and empty eq false ge gt le lt ne not null true case C is when 'a' => if P.Expr (P.Token_Start .. P.Token_End) = "and" then Token := T_LOGICAL_AND; return; end if; when 'd' => if P.Expr (P.Token_Start .. P.Token_End) = "div" then Token := T_DIV; return; end if; when 'e' => if P.Expr (P.Token_Start .. P.Token_End) = "eq" then Token := T_EQ; return; elsif P.Expr (P.Token_Start .. P.Token_End) = "empty" then Token := T_EMPTY; return; end if; when 'f' | 'F' => if P.Expr (P.Token_Start .. P.Token_End) = "false" then Token := T_FALSE; return; end if; when 'g' | 'G' => if P.Expr (P.Token_Start .. P.Token_End) = "ge" then Token := T_GE; return; elsif P.Expr (P.Token_Start .. P.Token_End) = "gt" then Token := T_GT; return; end if; when 'm' | 'M' => if P.Expr (P.Token_Start .. P.Token_End) = "mod" then Token := T_MOD; return; end if; when 'l' | 'L' => if P.Expr (P.Token_Start .. P.Token_End) = "le" then Token := T_LE; return; elsif P.Expr (P.Token_Start .. P.Token_End) = "lt" then Token := T_LT; return; end if; when 'n' | 'N' => if P.Expr (P.Token_Start .. P.Token_End) = "not" then Token := T_NOT; return; elsif P.Expr (P.Token_Start .. P.Token_End) = "ne" then Token := T_NE; return; elsif P.Expr (P.Token_Start .. P.Token_End) = "null" then Token := T_NULL; return; end if; when 'o' => if P.Expr (P.Token_Start .. P.Token_End) = "or" then Token := T_OR; return; end if; when 't' | 'T' => if P.Expr (P.Token_Start .. P.Token_End) = "true" then Token := T_TRUE; return; end if; when others => null; end case; Token := T_NAME; return; when '(' => Token := T_LEFT_PARENT; return; when ')' => Token := T_RIGHT_PARENT; return; when '+' => Token := T_PLUS; return; when '-' => Token := T_MINUS; return; when '.' => Token := T_DOT; return; when ',' => Token := T_COMMA; return; when '*' => Token := T_MUL; return; when '/' => Token := T_DIV; return; when '%' => Token := T_MOD; return; when '?' => Token := T_QUESTION; return; when ':' => Token := T_COLON; return; when '!' => Token := T_NOT; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '=' then P.Pos := P.Pos + 1; Token := T_NE; end if; end if; return; when '<' => -- Comparison operators < or <= Token := T_LT; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '=' then P.Pos := P.Pos + 1; Token := T_LE; end if; end if; return; when '>' => -- Comparison operators > or >= Token := T_GT; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '=' then P.Pos := P.Pos + 1; Token := T_GE; end if; end if; return; when '&' => Token := T_AND; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '&' then Token := T_LOGICAL_AND; P.Pos := P.Pos + 1; end if; end if; return; when '|' => Token := T_UNKNOWN; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '|' then Token := T_OR; P.Pos := P.Pos + 1; end if; end if; return; when '=' => Token := T_UNKNOWN; if P.Pos <= P.Expr'Last then C1 := P.Expr (P.Pos); if C1 = '=' then Token := T_EQ; P.Pos := P.Pos + 1; end if; end if; return; when '}' => Token := T_BRACE_END; return; when others => Token := T_UNKNOWN; return; end case; end Peek; -- ------------------------------ -- Parse a number -- ------------------------------ procedure Parse_Number (P : in out Parser; Result : out Long_Long_Integer) is Value : Long_Long_Integer := 0; Num : Long_Long_Integer; C : Wide_Wide_Character; begin while P.Pos <= P.Expr'Last loop C := P.Expr (P.Pos); exit when C not in '0' .. '9'; Num := Wide_Wide_Character'Pos (C) - Wide_Wide_Character'Pos ('0'); Value := Value * 10 + Num; P.Pos := P.Pos + 1; end loop; Result := Value; end Parse_Number; -- ------------------------------ -- Parse a function call. -- The function call can have up to 4 arguments. -- ------------------------------ procedure Parse_Function (P : in out Parser; Namespace : in String; Name : in String; Result : out ELNode_Access) is Token : Token_Type; Arg1, Arg2, Arg3, Arg4 : ELNode_Access; Func : Function_Access; begin if P.Mapper = null then raise Invalid_Expression with "There is no function mapper"; end if; Func := P.Mapper.Get_Function (Namespace, Name); -- if Func = null then -- raise Invalid_Expression with "Function '" & N & "' not found"; -- end if; -- Extract the first argument. -- Number of arguments is pre-defined P.Pos := P.Pos + 1; Parse_Choice (P, Arg1); Peek (P, Token); if Token /= T_COMMA then if Token /= T_RIGHT_PARENT then raise Invalid_Expression with "Missing ')' at end of function call"; end if; Result := Create_Node (Func, Arg1); return; end if; Parse_Choice (P, Arg2); Peek (P, Token); if Token /= T_COMMA then if Token /= T_RIGHT_PARENT then raise Invalid_Expression with "Missing ')' at end of function call"; end if; Result := Create_Node (Func, Arg1, Arg2); return; end if; Parse_Choice (P, Arg3); Peek (P, Token); if Token /= T_COMMA then if Token /= T_RIGHT_PARENT then raise Invalid_Expression with "Missing ')' at end of function call"; end if; Result := Create_Node (Func, Arg1, Arg2, Arg3); return; end if; Parse_Choice (P, Arg4); Peek (P, Token); if Token /= T_RIGHT_PARENT then raise Invalid_Expression with "Missing ')' at end of function call"; end if; Result := Create_Node (Func, Arg1, Arg2, Arg3, Arg4); exception when others => Delete (Result); Delete (Arg1); Delete (Arg2); Delete (Arg3); Delete (Arg4); raise; end Parse_Function; procedure Parse (Expr : in String; Context : in ELContext'Class; Result : out EL.Expressions.Nodes.ELNode_Access) is P : Parser (Length => Expr'Length); begin Result := null; P.Mapper := Context.Get_Function_Mapper; P.Expr := To_Wide_Wide_String (Expr); P.Pos := P.Expr'First; Parse_EL (P, Result); if P.Pos <= P.Expr'Last or P.Pending_Token /= T_EOL then raise Invalid_Expression with "Syntax error at end of expression"; end if; exception when others => Delete (Result); raise; end Parse; procedure Parse (Expr : in Wide_Wide_String; Context : in ELContext'Class; Result : out EL.Expressions.Nodes.ELNode_Access) is P : Parser (Length => Expr'Length); begin Result := null; P.Mapper := Context.Get_Function_Mapper; P.Expr := Expr; P.Pos := P.Expr'First; Parse_EL (P, Result); if P.Pos <= P.Expr'Last or P.Pending_Token /= T_EOL then raise Invalid_Expression with "Syntax error at end of expression"; end if; exception when others => Delete (Result); raise; end Parse; end EL.Expressions.Parser;

32.339388

100

0.427203

ad7bcf0c40209398c8cde29bd6c7003061def5b8

1,161

ads

Ada

lib/aflexnat/ascan_io.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

1

2018-08-11T01:51:27.000Z

lib/aflexnat/ascan_io.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

null

lib/aflexnat/ascan_io.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

null

with ascan_dfa; use ascan_dfa; with text_io; use text_io; package ascan_io is user_input_file : file_type; user_output_file : file_type; NULL_IN_INPUT : exception; AFLEX_INTERNAL_ERROR : exception; UNEXPECTED_LAST_MATCH : exception; PUSHBACK_OVERFLOW : exception; AFLEX_SCANNER_JAMMED : exception; type eob_action_type is ( EOB_ACT_RESTART_SCAN, EOB_ACT_END_OF_FILE, EOB_ACT_LAST_MATCH ); YY_END_OF_BUFFER_CHAR : constant character:= ASCII.NUL; yy_n_chars : integer; -- number of characters read into yy_ch_buf -- true when we've seen an EOF for the current input file yy_eof_has_been_seen : boolean; procedure YY_INPUT(buf: out unbounded_character_array; result: out integer; max_size: in integer); function yy_get_next_buffer return eob_action_type; procedure yyunput( c : character; yy_bp: in out integer ); procedure unput(c : character); function input return character; procedure output(c : character); function yywrap return boolean; procedure Open_Input(fname : in String); procedure Close_Input; procedure Create_Output(fname : in String := ""); procedure Close_Output; end ascan_io;

31.378378

98

0.764858

1eaff2b2d0f0c33a69b473bf402571f3c1020380

2,590

adb

Ada

awa/src/awa-modules-reader.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/src/awa-modules-reader.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/src/awa-modules-reader.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-modules-reader -- Read module configuration files -- Copyright (C) 2011, 2012, 2015, 2017 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Serialize.IO.XML; with Util.Serialize.Mappers; with AWA.Applications.Configs; with Security.Policies; -- The AWA.Modules.Reader package reads the module configuration files -- and initializes the module. package body AWA.Modules.Reader is -- ------------------------------ -- Read the module configuration file and configure the components -- ------------------------------ procedure Read_Configuration (Plugin : in out Module'Class; File : in String; Context : in EL.Contexts.Default.Default_Context_Access) is Reader : Util.Serialize.IO.XML.Parser; Mapper : Util.Serialize.Mappers.Processing; package Config is new AWA.Applications.Configs.Reader_Config (Mapper, Plugin.App.all'Unchecked_Access, Context, False); pragma Warnings (Off, Config); Sec : constant Security.Policies.Policy_Manager_Access := Plugin.App.Get_Security_Manager; begin Log.Info ("Reading module configuration file {0}", File); Sec.Prepare_Config (Mapper); if AWA.Modules.Log.Get_Level >= Util.Log.DEBUG_LEVEL then Util.Serialize.Mappers.Dump (Mapper, AWA.Modules.Log); end if; -- Read the configuration file and record managed beans, navigation rules. Reader.Parse (File, Mapper); Sec.Finish_Config (Reader); exception when others => Log.Error ("Error while reading {0}", File); raise; end Read_Configuration; end AWA.Modules.Reader;

39.242424

99

0.594981