Search is not available for this dataset
text
stringlengths 0
3.2M
| lang
stringclasses 14
values |
|---|---|
Mayfair SlimMaster is a revolutionary slimming technology that uses positive & negative pressure to generate micro bubbles that cause fatty deposits to break up. It is also promote metabolism for the body in order to enhance the shapelier contours. An exclusive, non-invasive slimming technology! SlimMaster does not cause any pain or damage to the skin as no surgery is needed.
Add some facial cream to a glass of water. Its oil content makes it float on the water. Place Pro 1 into the glass. Facial cream begins to mix with water as micro-bubbles break down the oil content.
A piece of fatty chicken skin is placed on Pro 1. After 2 minutes, micro bubble break down fat, causing the fat it to drip out of the skin. | english |
I’m grateful to share Brandon Fredenburg’s contribution to our Summer Blog Tour. Brandon is a thoughtful writer who shares resources and perspectives that I usually overlook.
I’m afraid the title is more ambitious than my few paragraphs offer. To make my task more manageable, I offer a few idea-starters about the gospel as taught by Jesus, Paul, and the early church bishop, Athanasius.
to proclaim the year of the Lord’s favor (my translation).
When Jesus omits “and the day of our God’s vengeance” (Isa 61:2b) and rehearses God’s blessing of a foreign widow and an enemy general, he turns the gospel of God his hearers expect inside out. “He isn’t just our God and he blesses our enemies,” Jesus reveals. Their reaction, like their “God,” is one of deadly vengeance.
Perhaps this is why Jesus begins his evangelizing with the word “repent.” Apparently, even John the Baptist missed it, as Matthew 11:1–15 makes clear. Jesus says those who even barely grasp his message have far greater insight than John. John’s gospel of violent, fiery judgment, it seems, put him at odds with Jesus’s view of the nature of the kingdom of the heavens. “Repent,” then, as Jesus uses it, retains its core meaning of “shift your paradigm” with reference to God and God’s kingdom. For John, repentance focused on the personal sacrifices required for holiness; for Jesus, repentance kept its eyes on the merciful nature of God toward all persons (Exod. 34:5–7; Jonah 4:2b). “For I delight in mercy but not sacrifice; and in knowledge of God rather than burnt offerings” (Hos. 6:6, my translation).
Jesus’s gospel is about his Father and his Father’s nature. The Father’s nature was so misunderstood, Jesus claims no one but he knows the Father (Matt. 11:27). He then immediately invites those wearied and burdened by compromised gospels of God to come to him for rest, to take on the easy, restful yoke of learning as a disciple of his gentle humility and light burden. “No one knows the Father except the Son”: not John the Baptist, not the Pharisees or the scribes, not Moses or Elijah, not Jesus’s disciples, no one except he … and his post-resurrection disciples. The Father is known rightly and fully only through his Son (Heb. 1:1–3b).
Jesus’s gospel reframed a self-serving view of his Father’s compassion; Paul’s gospel applied Jesus’s message more widely. Two passages are especially rich: 2 Cor. 5:11–21 and Eph. 2:1–10.
In 2 Cor. 5:14, Paul claims that Christ’s death universally incorporates humanity. In his death, all died. When this insight becomes clear, a whole new world comes into focus. Paul knows this from his own experience: before he embraced it, he viewed Jesus as a renegade false prophet whose death was just. Once the scales fell from Saul’s eyes, he saw the new creation. He no longer saw through Adam’s blind, fearful, ashamed, sin-focused eyes. Jesus Messiah incarnated into the old, blinded, fearful, ashamed, sin-wracked Adamic humanity, embraced it and us fully and carried it and us into Death. And by God’s own unilateral act of cosmic justice, Jesus (and it and us) were raised to newness.
Paul makes a parallel point in Ephesians 2, but goes farther. In 2:1–3, Paul sets the cosmic stage: we were all dead in our sins, naturally characterized by impulsive anger, like the rest of humanity. The “we” in 2:1–3 is undoubtedly all Adamic humanity. “But,” Paul contrasts, “God, being rich in mercy, because of his abundant love with which he loved us — even while we were dead in our sins — co-enlivened us with Christ: you are rescued by [God’s] favor!” Not only did we all die with Christ, God raised us all up and seated us all with Christ. This rescue from Death is anchored in God’s favor, accomplished by God’s faithfulness, given as unconditional gift, and integral to God’s (new) creation-act.
Paul extends Jesus’s gospel to include Jesus’s cooperation with the Father in rescuing Adamic humanity from its errant view of God and the self-caused alienation “in our own minds” (Col 1:21). The rescue for all humanity has been a fait accompli since Jesus’s resurrection. The message of what God has done in Christ is proclaimed so that, by awakening to its truth, all persons can dwell in the present blessings of the new creation.
Just as Paul authoritatively interpreted Jesus’s gospel in scripture, Athanasius’s views both reflected and influenced the understanding of the early church (ca. 200–400). In contrast, Augustine’s perspectives (post-400) dominated the Latin church and, through it, the Reformers and most of contemporary Evangelicalism.
In his On the Incarnation of the Word, Athanasius explains that humanity, brought to life out of nothing, maintained life by keeping a clear knowledge of God’s nature (i.e., the Logos) within them. Humanity’s existence depended on an uncompromised trust and dependence on God. Once the devil deceived humanity into mistrust, humanity cut itself off from its source of life and knowledge. Thus, by degrees, humanity not only lost its ability for clear reason, it began to disintegrate into physical death and, beyond that, into the corruption of utter nothingness; that is, into Death. Return to nothingness was not a God-imposed punishment, but a God-warned natural consequence of cutting our own umbilical cord.
It was both intolerable to and unworthy of God that he would do nothing to rescue those created in his own likeness, especially because they had been tricked by falsehood, and because a neglect to rescue them would demonstrate weakness. Thus, a rescue by the Logos that had created humanity was needed. The incarnated Logos fully incorporated all humanity into his own body, joining corruptible to incorruptible, and sacrificed himself (and us in him) to death to settle Death’s claim. Since Christ is the incorruptible Logos, Death could not contain him. By Christ’s death, Death died. Because we died his death and he ours, physical death is no punishment and Death-as-annihilation is no possibility. Moreover, once Death died, Christ then offered himself (and us in him) to the Father, who raised him as firstfruits and will raise us-in-him at the final resurrection.
The gospel of God is not an invitation. It has no steps for us to climb to seek and gain God’s favor. It is not an offer that, by accepting, we activate its benefits. No, the gospel is far greater.
The gospel is the astounding declaration that, despite having gotten God all wrong in our thinking, having mischaracterized, misrepresented, maligned, mistreated, and had malice toward him, God has never been against us. To be sure, God has been against all our fearful, ignorant, misguided, vengeful characterizations of him and their effects, but he has endured them to be with us so that we might truly glimpse him and repent. He did not leave the glimpses to chance, but manifested himself entirely in the Lord Jesus Christ and the new creation life in which we participate. The basis of the gospel has always been God’s compassionate nature toward all creation; its benefits have always been active for all persons, but its enjoyment is possible only to those whose eyes see. Repent, and believe the gospel of God!
Peace and all good to all, always.
Brandon L. Fredenburg is a professor of Biblical Studies and assistant dean for the College of Biblical Studies and Behavioral Sciences at Lubbock Christian University. He lives, ministers, and teaches in Lubbock, Texas.
I’m not sure that I’ve ever heard “Simplicity” named as a value within Churches of Christ, yet it exudes from each and every historical pore. Perhaps the value is best represented in our pioneers’ pursuit of “common sense” theology & philosophy. Consider the numerous ways the Restoration Movement has sought to distinguish itself from other churches.
We rejected human creeds as extra-biblical with with simple slogans such as “No creed but Jesus”, and “Bible names for Bible things”.
We taught against denominational structures in favour of self-autonomous congregations (not a Bible term).
The Restoration Movement has always emphasised the priesthood of all believers, and the ability of each individual to interpret Scripture for him/herself. This contrasts with denominations who have an ordination process for their clergy, dress them in robes, an d call them by a title.
The leadership of local congregations rests with elders and deacons appointed according to the Biblical criteria of Titus 1 and 1 Timothy 3. There is no elected board or constitution to negotiate.
Churches of Christ have seldom attempted to build cathedrals. Most church buildings have emphasised simplicity and rejected stained glass, paintings and ornaments as distractions and potentially idols.
All of these customs reveal an underlying value of simplicity, whether this term is ever used or not. The Restoration Movement was all about Simple Church even before the book was written.
In my experience the church has rarely made the same application to Christians’ personal lives. Many preachers and church members have undoubtedly sacrificed a lot to spread the kingdom of God, but I don’t know that this has been widely preached as an expectation of the church.
Both Harding and Lipscomb lived this way as a result of their conviction that God calls all Christians to live as pilgrims, or resident aliens in the world trusting in the providence of God. In The Cruciform Church (p169), C. Leonard Allen calls attention to 1 John 2:15-17.
Jesus kingdom is not of this world. (Jn 18:36) We live in a society of gadgets. The advertising industry constantly entices us with the next hot thing: the thing that will truly make our lives simpler. Often we buy into the deception that more stuff will create more space. It doesn’t work. Removing stuff remains the only way to create space. When Jesus needed time with God he removed himself from his village, from his friends, from the crowds, and found the quiet space of a hillside.
I don’t want to use this post to suggest that Christians should sell everything and live under a bridge. I don’t want everyone to turn Amish. I don’t want to give the impression that God is simple, He’s not. I do want to call all Christians back to the fact that our faith and our lives orbit around God. He’s our centre. In a busy and materialistic world we need to create space to spend time with God. To listen to God. To talk with God. What have traditionally been called “spiritual disciplines” need to regain prominence in the lives of the church. It’s not enough to have simple church buildings. We need a simple faith, and a simple relationship, that allows us to tackle the complexities of life.
Hopefully, in the next couple of days I’ll put up a couple of posts on Spiritual Disciplines.
Have you been part of a church that actively encourages members to practice spiritual disciplines? How did they do this?
How important are personal spiritual disciplines in your life?
Churches often promote prayer and Bible reading as standard disciplines. Are you content with the basics or is it important in your relationship with God to be creative?
Does your relationship with God benefit more by practicing a variety of disciplines or a variety of approaches to the basics such as prayer and Bible reading?
This week I’m posting daily discussion of points I raised in my July 8 sermon on the topic of worship. The sermon highlighted four pairs of values that often seem in tension with each other. Here is the second pair.
Historically, Catholicism stressed the role of the church as a conduit to saving relationship with God. Even though they valued personal piety and even monasticism and solitude, they still administered these personal disciplines under the auspices of the church. One of the major offenses leading to the brutal persecution of Anabaptists in the during the Reformation by all major denominations of the time, was their teaching that individuals needed to decide for themselves whether they wanted to follow Christ. Anabaptists believed that the church could not save someone who didn’t want to be saved. Popular thought at the time held that you were a Christian courtesy of whichever church had baptised you, usually as an infant.
The pioneers of the Restoration Movement similarly held that the churches of their day had assumed too much power in determining individual’s salvation. Alexander Campbell’s personal experience involved being interviewed by elders at a church to determine his worthiness to participate in their semi-annual Lord’s Supper. As Campbell and other restoration preachers traveled the western frontier they gave people the opportunity to make their own decision to follow Christ. By fulfilling the five steps of salvation laid out in Scripture individuals could gain confidence in their salvation without it needing to be ratified by the church. Modern evanglicalism took this a step further in their emphasis on Jesus as a “personal Saviour”.
Perhaps as an inevitable consequence, many people today seem to hold the position that they don’t have to worship with the church to be a Christian. Often they present this in a way that sounds spiritual and pious, but there’s no doubt that God intended the church to come together to worship Him. All the letters in the New Testament were written to or about churches: groups of Christians. Some passages give considerable detail about how the church should conduct itself when it comes together. For example, 1 Cor. 14 describes a gathering of the NT church, as does 1 Cor 11. Additionally, the numerous “one another” instructions scattered throughout the New Testament writings can only be practiced in a congregational context.
I can think of numerous worship songs that we sing connecting our time of worship with the presence of God.
Ironically, as I got up to preach this sermon, we sang “May My Steps be Worship”. Only in this particular version an over zealous editor had changed the line to read “May My Steps Lead to Worship”. It was the perfect (if tragic) example of the topic at hand!
Individuals do need a personal relationship with God. Jesus died for each of our sins individually. At Pentecost (Acts 2), the apostle Peter did not respond to the corporate question “What must we do [to receive forgiveness]?” by symbolically baptising the crowed with a bottle of water. Each person individually had their sins removed in baptism (“Those who accepted his message were baptised, … about three thousand…”) and individually received the gift of the Holy Spirit in their lives.
But individuals also need a church. In 1 Corinthians 12:15 we find the illustration that a part of the body (foot or ear) decides to separate itself, it can’t. Christians, by nature, form an interconnected body and our attempts to isolate ourselves run counter to God’s design. Verse 26 demonstrates this perfect design, “If one part suffers, every part suffers with it; if one part is honored, every part rejoices with it.” An additional benefit of body life is described in Hebrews 3:13 “encourage one another daily, as long as it is called ‘Today,’ so that none of you may be hardened by sin’s deceitfulness.” Our eternal salvation benefits from the involvement of other Christians in our lives.
It saddens me that the term “worship wars” has been used over the years to describe the conflict (often inter-generational) between traditional and contemporary music styles in worship. I’m eagerly waiting for the day when we have “worship wars” over whether we’re doing enough to worship Monday to Saturday.
Also relevant is They Like Jesus But Not the Church by Dan Kimball (Zondervan: 2007) which encourages the church to leave its ivory tower and live the way we teach.
How do you make your daily life an “act of worship”? What does that mean to you?
Do you regard Sunday worship more as a culmination of your past week of worship, or necessary to prepare you for the coming week?
I’m transitioning my Family Reunion sermon series from discussing our genealogy to looking at some areas of faith and church life that the Restoration Movement has rightly emphasised. These areas do not necessarily make us unique, but they are still important to who we are.
If your family traveled to Disney World every 5 years, you could never say that visiting Disney made your family unique, but the regularity of your trips and the uniquely shared memories would make those trips an important element in your family’s identity. In a similar way all churches gather together to collectively worship God. However, the Church of Christ has our own set of customs and emphases around this event that shape our identity.
I believe that deeply engrained in the subconscious of Churches of Christ is the conviction that “our corporate worship must please God“. In a sense, our acapella singing reflects this conviction. We might personally prefer singing with instrumental accompaniment (and lets be honest, that’s what 99.8% of us listen to on our radios and ipods), but we sacrifice our preferences to worship God in a manner which he apparently prefers.
Since my roots run on the instrumental side of the Restoration Movement but I now minister in an acapella church, I think I have a pretty good grasp of both sides of that discussion. That’s not where I want to go today. I believe that Churches of Christ for 200 years have done a good job of reminding the world that our worship must be God-focused. This is particularly important in a broader environment where “attractional” models of worship-evangelism continually push the envelope toward mere entertainment.
One of the big topics in any Bible study about worship revolves around the topic of whether worship only happens in designated acts and at designated times (eg. 10am Sunday, or prayer at my desk) or whether worship engages the entire spectrum of our life activities. (I recently heard a presentation that suggested that Christian coaches should encourage their players to view their athletic events as worship.) I believe the answer is Yes. We should live our entire lives in a way that brings glory and honour to God. On the other hand, we can’t really equate playing football to singing praise to God with room full of other Christians, or to the broken hearted prayer of a repentant sinner sitting in their car.
Worship is one’s heart expression of love, adoration, and praise to God with the attitude and acknowledgement of his supremacy and Lordship.
Worship is an act by a redeemed person (the creature), toward God (the Creator), whereby his will, intellect and emotions gratefully respond in reverence, honor, and devotion to the revelation of God’s person expressed in the redemptive work of Jesus Christ, as the Holy Spirit illuminates God’s written word to his heart.
Worship means “to feel in the heart,” and to express in some appropriate manner what we feel.
True worship and praise are “awesome wonder and overpowering love” in the presence of our God.
The heart of true worship is the ability to magnify God with our whole being – body, soul, and spirit.
Worship is fundamentally God’s Spirit within us contacting the Spirit in the Godhead.
Worship is the humbling of self and the exalting of God.
Worship is the act and attitude of wholeheartedly giving ourselves to God, spirit, soul and body. Worship is simply the expression of our love for God, which Jesus said, should involve all our heart, mind, and physical strength. (Gerrit Gustafson in Psalmist (Feb-March, 1991), 31.
I know that’s a long list!
How do you define worship? Do you agree with one of the above, or does the final conclusion more closely reflect your approach?
Notice that all these definitions focus upon our relationship with God. In your experience, do most churches focus upon the HOW or the WHY of worship?
How can churches do a better job of communicating the WHY of worship?
One of the exciting aspects of the Restoration Movement is the name “Restoration”. While it has previously had a fairly narrow focus on “restoring the New Testament church”, we have an opportunity to expand that application. In many ways the whole of Scripture describes a movement toward restoration. In Acts 3:21 the apostle, Peter, described the return of Jesus as “the time … for God to restore everything , as he promised long ago through his holy prophets.” History culminates, not in destruction, but in restoration!
If the church exists as an outpost of God’s kingdom, then we must adopt His mission as our mission. As God works toward restoration, then we must also. But what does this look like? I believe it means that the church and its members will involve ourselves in social and humanitarian causes that work to restore justice and equality in our society. When we see decay and brokenness we recognise the need for God’s restorative healing to work. This need may exist in a marriage, or in a neigbourhood, or a nation. The grand scheme of restoration involves eliminating hunger, disease, war, environmental pollution, discrimination, etc. While we live in a world impacted by sin we can’t eliminate all of these, but we can make a difference for God.
To see an example of a church that has committed itself to the expanded theme of restoration visit the website www.ARestorationMovement.com. The Highland Church of Christ in Abilene, TX has committed itself to restoration projects within the church, the local community and around the world. You can listen to the sermon that launched this project here.
Of course, restoration of a spiritual relationship between God and humanity through the death and resurrection of Jesus remains the primary mission of the church. But proclamation of the Gospel still fits within a greater context of the restoration of Creation which we cannot ignore.
What’s your first thought at the idea of linking faith with environmental stewardship?
What comes to your mind when you think of Christ returning to “restore all things”?
Can you think of examples from the New Testament that demonstrate an enlarged Restoration Movement?
Read 2 Timothy 2:22-26 here.
Last week I criticised the application of the Restoration Plea to restore the New Testament church. I believe that too much emphasis has been placed on restoring New Testament structures, leadership models, and worship habits. The Restoration Movement, and Churches of Christ in particular, has generally come to define itself by these issues.
My greatest concern is that none of the New Testament authors thought it necessary to discuss these issues in detail. (Paul’s treatment of the Lord’s Supper in 1 Corinthians 11 proves an exception, but still doesn’t address questions of which day, or how often to participate in the Supper.) The obvious reason for this omission is that the New Testament letters are occasional in nature and address specific issues that particular congregations or individuals faced. We learn from these teachings and apply all we learn to our lives and churches, but we’ll never have every single question answered unequivocally.
Still, if specifying an exact 24 hr period in which to worship was crucial to our relationship with God, it’s hard to imagine that there was never any tension between Jews and Gentiles regarding this issue. After all, the Jewish day begins at sunset, and the Roman day begins at midnight. So the Jews could worship and take the Lord’s Supper on Saturday night and still be “meeting on the first day of the week”, while the Gentiles would have to wait until midnight. Then the Gentiles could worship Sunday night when the Jews couldn’t. Surely it would have been necessary to clarify this “important” issue in one of the letters to ensure that “true” worship was offered to God!
(I might have just chased a hare with that last paragraph.) The primary point of this post and the previous one is that we have misplaced our priorities. Here’s my suggestion for how to “restore” our priorities. We need to restore an emphasis on the explicit Biblical teachings. There are many places to begin this restoration process, such as the Sermon on the Mount. My suggestion is to review numerous lists of virtues scattered throughout the New Testament. The problem is I don’t think all of these ever disappeared, but I do think all Christians need to be reminded of them regularly.
Often the “Lists of Virtues” are juxtaposed with “Lists of Vices”. For instance, The Fruit of the Spirit in Galatians 5:22-23 immediately follow the Fruit of the Flesh in verses 19-21. It seems Christianity in general has done a much better job of communicating the “Lists of Vices” than the more positive “Lists of Virtues”. Churches effectively communicate the evils of say… abortion and homosexuality, but apparently struggle to help people grow more patient or gentle. They also have not proved very effective at actually reducing participation in the “vices”. It’s no wonder outsiders regard us as hypocrites when we don’t practice what we preach.
Can you imagine how our churches would be different today if 200 years ago our most influential preacher, teachers, and writers had emphasised the need for self-control, or taught us how to think on whatever is noble, and lovely. If we had 200 years of teaching on how to add goodness to faith (2 Peter 1:5) without becoming self-righteous and while maintaining humility, how might our movement be different today?
I’m convinced that that when the New Testament church is restored, or created, it will be known as the church that loves the most. It will be the church that practices the most patient. It will be the church that forgives the most readily. It will be the church that most demonstrates humility. And it will demonstrate these virtues not through its perfection, but because it embraces people who need love, who stretch patience, who regularly offend and require forgiveness. It will NOT be known as the church with the most correct worship service or leadership structure.
I wrote a lot more than I intended when I started this post. Now it’s your turn, any comments?
How can churches practically help Christians practice Godly virtues? Apparently just preaching about it isn’t enough.
Do you agree that churches generally preach about vices more than virtues?
What defines a “New Testament church” in your mind?
No denominations in the Bible – so they must all be wrong.
The priesthood of all believers (2 Peter 2:5) means clergy is wrong.
Elders and deacons are the only biblical church leaders – any other hierarchy is wrong.
The Bible always refers to a plurality of elders/deacons – so it’s wrong to have just one.
The NT church met on Sunday – any other day is wrong.
They believed the Lord’s Supper must be celebrated each Sunday – any other schedule is wrong.
No creed but the Bible!
When the pioneers of the Restoration Movement established a congregation that looked like this, they believed they had restored the New Testament church.
However, it’s doubtful that a single congregation ever implemented all the New Testament teaching. I believe many churches may have had the qualities listed above, but the majority of the epistles were written to correct the New Testament churches. When the New Testament teaches on how the church should be structured and how it should behave God speaks in a theoretical way. The New Testament epistles don’t really describe an existing church, they encourage the existing church to attain a higher degree of maturity.
So can we restore something that never existed? Stone and Campbell used the word “restore” because they were convinced that existing churches had moved so far from the teaching of the New Testament. Perhaps they more accurately “sought to radically implement the New Testament teachings in a new church movement”. They would have rejected this proposal as they didn’t want to start another denomination, but I think it’s a closer description their teachings.
Further, most items on the above list come from “logical conclusion” rather than explicit New Testament teaching. Surely restoring the New Testament church would mean focusing on the explicit teachings of Scripture, not on extrapolations and necessary inferences.
For example, does the fact that the church described in the New Testament met on Sunday really forbid meeting on any other day? That’s a logical conclusion. On the other hand, James 4:12 explicitly establishes God as the only judge and asks, “But you – who are you to judge your neighbor?” However, that hasn’t prevented churches of Christ frequently disfellowshipping other churches and freely “writing up” individuals and pointing the finger at entire denominations. When logical conclusions relegate explicit teaching to second place the New Testament has NOT been restored.
Can you suggest some other CoC “distinctives” related to structure and worship to add to my list?
Is it important to you for a church to be a New Testament church?
Do you think all churches today are New Testament churches?
What identifies a New Testament church in your mind?
I’m not preaching this week, so I’m able to use my time to prepare for my next sermon series. Our church has decided to make June “Family Reunion Month” (perhaps becoming an annual event) as we revisit some of our basic beliefs and practices.
Discussing the virtue of the goal of “Restoring the NT church”.
Re-visioning and expanding the goals of the Restoration Movement along the lines of the Highland Church of Christ in Abilene, TX.
Examining some of our peculiar practices that we draw identity from and explaining them to newcomers. For example: Our high view of Scripture and our emphasis on making worship about God. The value of weekly Lord’s Supper is another positive practice.
What are the positive themes and practices that you can identify among Churches of Christ?
Read the related posts here.
We find one of the traditional “Steps of Salvation” that people often overlook in Matthew 10:22 “You will be hated by all for my name’s sake. But the one who endures to the end will be saved.” This is a much more important message than the often quoted first step of “Hear”. Why tell someone who’s already listening to you that they need to “hear”? On the other hand, we must encourage new Christians to understand that they’re making a long-term commitment.
James 1:4 “Let perseverance finish its work so that you may be mature and complete, not lacking anything.
Love – 1 Cor. 13:7 says “Love always perseveres.” Love will help us endure where obedience would just give up. Love is the stronger motivation. When our relationship with God is based on love, we’re more likely to survive the difficult times.
Prayer – Calling on God in times of trouble invites God to actively help us through those times. In 2 Cor 12:9 Paul quotes God saying “My grace is sufficient for you, for my power is made perfect in weakness.” The times we’re most aware of our shortcomings are the times we create the most space in our lives for God to demonstrate his power. We depend on him, rather than ourselves.
Scripture – The psalmist described God’s words as “a lamp to my feet and a lamp to my path“. God’s word guides us through life with its teaching, advice and examples. The Bible also motivates and inspires us by reminding us of our goal: our God.
The Holy Spirit – Most importantly, when we immerse ourselves into Christ, we “enter God” and simultaneously “God enters us.” According to Acts 2:38 We receive the “Gift of the Holy Spirit”. It’s this very same Spirit that Jesus describes as a Comforter, or Encourager, or Counselor in John 14:16. It’s the Holy Spirit’s role to comfort, encourage, and counsel when our faith is on the rocks. When life is tough God will still be with us, helping us to endure. We don’t have to endure alone.
Why do you think this “Step” seldom makes the list?
How do you cultivate your faith to give it endurance? | english |
மூட நம்பிக்கையால் மீண்டும் கொடூரம்! மகனை பலி கொடுத்த தாய்! கேரளாவில் மூட நம்பிக்கையால் தாயே தனது மகனை பலி கொடுத்த சம்பவம் அதிர்ச்சியை ஏற்படுத்தியுள்ளது. சமீபத்தில் மூட நம்பிக்கையால் பெற்றோர் ஒருவர் தனது இரண்டு மகள்களை பலி கொடுத்த சம்பவம் அதிர்ச்சியை ஏற்படுத்திய நிலையில் அதேபோன்றதொரு சம்பவம் கேரளாவிலும் நடைபெற்றுள்ளது.கேரளா மாநிலம் பாலக்காடு பகுதியை சேர்ந்த சஹீதா என்ற பெண் தனது 6 வயது மகனை கொலை செய்த சம்பவம் அதிர்ச்சியை ஏற்படுத்தியுள்ளது. இதுகுறித்து வழக்குப்பதிவு செய்துள்ள போலீஸார் சஹீதாவை கைது செய்து விசாரிக்கையில், தனது மகனை பலியிடுமாறு கடவுளின் குரல் கேட்டதாக அந்த பெண் கூறியுள்ளார்.தொடர்ந்து இதுபோல கடவுள் சொன்னதாக பலியிடப்படும் சம்பவம் நடந்து வருவது பதட்டத்தை ஏற்படுத்தியுள்ளது. | tamil |
Components.utils.import('chrome://greasemonkey-modules/content/util.js');
var ppmm = Components
.classes["@mozilla.org/parentprocessmessagemanager;1"]
.getService(Components.interfaces.nsIMessageListenerManager);
var GM_MenuCommander = {
popup: null,
cookieShowing: null,
menuCommands: {},
messageCookie: 1,
};
GM_MenuCommander.initialize = function() {
ppmm.addMessageListener('greasemonkey:menu-command-response',
GM_MenuCommander.messageMenuCommandResponse);
};
GM_MenuCommander.uninitialize = function() {
ppmm.removeMessageListener('greasemonkey:menu-command-response',
GM_MenuCommander.messageMenuCommandResponse);
};
GM_MenuCommander.commandClicked = function(aCommand) {
gBrowser.selectedBrowser.messageManager.sendAsyncMessage(
'greasemonkey:menu-command-run',
{'cookie': aCommand.cookie, 'scriptUuid': aCommand.scriptUuid});
};
GM_MenuCommander.createMenuItem = function(command) {
var menuItem = document.createElement("menuitem");
menuItem.setAttribute("label", command.name);
menuItem.setAttribute("tooltiptext", command.scriptName);
menuItem.addEventListener("command", function() {
GM_MenuCommander.commandClicked(command);
}, false);
if (command.accessKey) {
menuItem.setAttribute("accesskey", command.accessKey);
}
return menuItem;
};
GM_MenuCommander.messageMenuCommandResponse = function(aMessage) {
if (aMessage.data.cookie != GM_MenuCommander.cookieShowing) return;
for (var i in aMessage.data.commands) {
var command = aMessage.data.commands[i];
var menuItem = GM_MenuCommander.createMenuItem(command);
GM_MenuCommander.popup.appendChild(menuItem);
}
if (GM_MenuCommander.popup.firstChild) {
GM_MenuCommander.popup.parentNode.disabled = false;
}
};
GM_MenuCommander.onPopupHiding = function() {
// Asynchronously. See #1632.
GM_util.timeout(function() { GM_util.emptyEl(GM_MenuCommander.popup); }, 0);
};
GM_MenuCommander.onPopupShowing = function(aEventTarget) {
GM_MenuCommander.popup = aEventTarget.querySelector(
'menupopup.greasemonkey-user-script-commands-popup');
GM_MenuCommander.messageCookie++;
GM_MenuCommander.cookieShowing = GM_MenuCommander.messageCookie;
// Start disabled and empty ...
GM_MenuCommander.popup.parentNode.disabled = true;
GM_util.emptyEl(GM_MenuCommander.popup);
// ... ask the selected browser to fill up our menu.
gBrowser.selectedBrowser.messageManager.sendAsyncMessage(
'greasemonkey:menu-command-list',
{'cookie': GM_MenuCommander.cookieShowing});
};
| code |
మహిళల కోసం ఎపిలో 14 దిశ కేంద్రాలు న్యూఢిల్లీ: హింసకు గురవుతూ ఆపదలో ఉన్న మహిళలను ఆదుకునేందుకు ఆంధ్రప్రదేశ్ లోని 13 జిల్లాల్లో 14 దిశ కేంద్రాల ఏర్పాటుకు కేంద్ర ప్రభుత్వం ఆమోదం తెలిపిందని మహిళాభివృద్ధి శాఖ మంత్రి స్మృతి ఇరానీ చెప్పారు. రాజ్యసభలో విజయసాయి రెడ్డి అడిగిన ప్రశ్నకు మంత్రి జవాబుస్తూ చిత్తూరు జిల్లాకు మంజూరు చేసిన రెండు కేంద్రాలలో ఒకటి ఇంకా పని ప్రారంభించలేదని తెలిపారు. హింసకు గురై విపత్తును ఎదుర్కొంటున్న మహిళలకు పోలీసు రక్షణ, వైద్య, న్యాయ సహాయం, న్యాయ సలహాలు, కౌన్సిలింగ్ సేవలతోపాటు వారికి ఆశ్రయం కల్పించేందు ఉద్దేశంతో సమీకృత సేవలను అందించే విధంగా దిశ కేంద్రాలను తీర్చిదిద్దినట్లు మంత్రి చెప్పారు. ఆపదలో ఉన్న మహిళలకు దిశ కేంద్రాల్లో రేయింబవళ్ళు సేవలు అందించడం జరుగుతుందని, మహిళల సాధికారతను సాధించే విధంగా వారికి రక్షణ, భద్రత కల్పించేందుకు మిషన్ శక్తి కార్యక్రమం కింద ఆయా జిల్లాల్లో దిశ కేంద్రాల స్థాపన జరిగిందని మంత్రి చెప్పారు. | telegu |
మనీ : తక్కువ పెట్టుబడి తో రూ. 30 వేలు లాభం.. కరోనా కాలంలో ప్రతి ఒక్కరూ డబ్బు లేక చాలా కష్టాలు పడుతున్నారు. ఇక ఇలాంటి సమయంలో బయటికి వెళ్లి ఉద్యోగం చేయాలన్నా కూడా భయపడుతున్నారు. ఇందుకు కారణం ఎవరి నుండి ఎప్పుడు , ఎక్కడ , ఎలా మనకు కరోన వైరస్ సోకుతుందో అనే భయపడుతూ, ఇంట్లోనే వర్క్ చేసుకోవడం మంచిదని చాలా మంది ప్రయత్నాలు చేస్తున్నారు. ఇకపోతే మరికొంతమంది సొంతంగా వ్యాపారం మొదలు పెట్టాలని ఆలోచిస్తున్నారు. ఇక అలాంటి వారికోసం ఇప్పుడు ఒక సరికొత్త వ్యాపారం మీకు అందుబాటులోకి తీసుకు వచ్చాము. ఆ వ్యాపారం ఏమిటంటే టీ పొడి తయారీ వ్యాపారం.ప్రస్తుత కాలంలో ప్రతి ఒక్కరు ఈ టీ తాగనిదే వారికి ఉదయం మొదలవ్వదు. అలాంటప్పుడు నీళ్ల తర్వాత ఎక్కువ మొత్తంలో ఖర్చు అయ్యేది ఈ టీ అని చెప్పవచ్చు. అందుకే ఈ టీ పొడి వ్యాపారం మొదలు పెట్టడం వల్ల ఎక్కువ లాభాలను పొందవచ్చు. ఈ టీ వ్యాపారం మొదలు పెట్టాలంటే ముందుగా రూ .5000 పెట్టుబడి పెడితే సరిపోతుంది. కేవలం తక్కువ మొత్తంతో వ్యాపారాన్ని మొదలుపెట్టి కృషి, పట్టుదల ఉండి వ్యాపారాన్ని చక్కగా చేసుకోవడం వల్ల అత్యధిక లాభాలను పొందే అవకాశం ఉంటుంది.అంతేకాదు ఈ వ్యాపారాలకు కేంద్ర ప్రభుత్వం నుంచి సహాయం కూడా లభిస్తుంది. ముఖ్యంగా మన భారత దేశంలో వివిధ ప్రాంతాలలో తేయాకు తోటల పెంపకాన్ని చేపట్టిన విషయం తెలిసిందే. ఇందులో ముఖ్యంగా డార్జిలింగ్ టీ అలాగే అస్సాం టీ లు చాలా ఫేమస్ పొందాయి. విదేశాలలో కూడా ప్రజలు వీటి రుచికి బాగా అలవాటుపడ్డారు. అందుకే ఈ రెండు రకాల ఆకులను పొడి రూపంలో తయారు చేసి అమ్మడం వల్ల మంచి ప్రయోజనం పొందవచ్చు. హోమ్ డెలివరీ, టీ షాప్స్, కేఫ్ అలాగే హోల్ సేల్ మార్కెట్లో కూడా వీటిని విక్రయించవచ్చు. దాదాపుగా నెలకు తక్కువలో తక్కువ రూ.30,000 లాభం గా పొందవచ్చు. మరి ఇంకెందుకు ఆలస్యం.. ఈ వ్యాపారంలోని మెళకువలు తెలుసుకుని మొదలుపెట్టవచ్చు.జగన్ అనవసరంగా కొత్త సమస్య తెచ్చుకుంటున్నారా...? బండి కాకపోయినా ధర్మపురికి అయినా... పాపం...? భారత్ చేరుకున్న 3 రాఫెల్ యుద్ధ విమానాలు? జగన్కు తెలియకుండా వ్యూహాన్ని పన్నిన ప్రశాంత్ కిషోర్? ఎన్నికల ముందు బిజెపికి రైతుల షాక్...? గుడ్ న్యూస్... తగ్గనున్న పెట్రోలు ధరలు? ఆ మైనర్ బాలిక యువకుడి వలలో పడి..చివరికి..? బుజ్జాయిల కోసం తల్లి పాల కేంద్రాలు ! ఏపీలో రేషన్ రాజకీయం.. మోదీని తిట్టుకుంటున్న జనం.. సోర్స్: ఇండియాహెరాల్డ్.కామ్ Divya | telegu |
\begin{document}
\title{On elliptic curve analogue of BRZ exact sequence}
\author{Abbas Maarefparvar}
\address{School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box: 19395-5746, Tehran, Iran.}
\curraddr{}
\email{[email protected]}
\thanks{This research was supported by a grant from IPM}
\date{}
\dedicatory{}
\commby{}
\subjclass[2010]{Primary 11R34, 11G05}
\begin{abstract}
For $K/F$ a finite Galois extension of number fields, the relative P\'olya group $\Po(K/F)$ is the subgroup of the ideal class group of $K$ generated by all the strongly ambiguous ideal classes in $K/F$. The notion of Ostrowski quotient $\Ost(K/F)$, as the cokernel of the capitulation map into $\Po(K/F)$, has been recently introduced in \cite{SRM}.
In this paper, using some results of Gonz\'alez-Avil\'es \cite{Aviles}, we find a new approach to define $\Po(K/F)$ and $\Ost(K/F)$. Using this manner and the analogy between ideal class groups and Tate-Shafarevich groups, we define the analogue notion of relative P\'olya group and Ostrowski quotient in the elliptic curve setting. More precisely, for an elliptic curve defined over $F$, under finiteness assumption of its Tate-Shafarevich groups over $F$ and $K$, we obtain an exact sequence, called EC-BRZ, which is the elliptic curve analogue of BRZ \cite{SRM}. Using EC-BRZ, we generalize a result of Yu \cite{Yu} and Gonz\'alez-Avil\'es \cite{Aviles2000}. Finally, using some results of Qiu \cite{Qiu} we get some applications of EC-BRZ for elliptic curves defined over quadratic extensions.
\end{abstract}
\maketitle
{\noindent \bf{Keywords:}}~ Tate-Shafarevich group, BRZ exact sequence, relative P\'olya group, Ostrowski quotient, transgression map.
\iffalse
\[
\begin{tikzcd}
0 \arrow{r} & A \arrow{r} \isoarrow{d} & B \arrow{r} \isoarrow{d} & C \arrow{r} \isoarrow{d} & 0 \\
0 \arrow{r} & A' \arrow{r} & B' \arrow{r} & C' \arrow{r} & 0
\end{tikzcd}
\]
\fi
{\noindent \bf{Notation.}}~ The following notations will be used throughout this article:
For a number field $F$, the notations $I(F)$, $P(F)$, $\Cl(F)$, $h_F$, $\mathcal{O}_F$, $U_F$ and $\mathbb{P}_F$ denote the group of fractional ideals, group of principal fractional ideals, ideal class group, class number, ring of integers, group of units and set of all prime ideals of $F$, respectively. For a finite extension $K/F$ of number fields, we use $N_{K/F}$ to denote both the ideal norm and the element norm map from $K$ to $F$. Also ${\epsilon}_{K/F}:\Cl(F) \rightarrow \Cl(K)$ denotes the capitulation map induced by the extension homomorphism from $I(F)$ to $I(K)$. For a prime ideal $\mathfrak{p} \in \mathbb{P}_F$, we denote by $e_{\mathfrak{p}(K/F)}$ the ramification index of $\mathfrak{p}$ in $K/F$.
\section{Introduction} \label{section, Introduction}
Let $K$ be an algebraic number field. For a prime power $q$, the \textit{Ostrowski ideal} $\Pi_{q}(K)$ of $K$ is defined as follows \cite{Ostrowski}:
\begin{equation} \label{equation, Ostrowski ideals}
\Pi_{q}(K) :=\prod_{\substack{\mathfrak{p}\in\mathbb{P}_K\\ N_{K/\mathbb{Q}}(\mathfrak{p})=q}} \mathfrak{p}.
\end{equation}
By convention, if $K$ has no ideal with norm $q$, we set $\Pi_{q}(K)=\mathcal{O}_K$. The number field $K$ is called a \textit{P\'olya field} if all the Ostrowski ideals $\Pi_{q}(K)$ for arbitrary prime powers $q$ are principal \cite{Zantema}. The notion of \textit{P\'olya-Ostrowski group} or \textit{P\'olya group} was introduced in \cite[Chapter II, $\S$3]{Cahen-Chabert's book}.
\begin{definition} \label{definition, Polya group}
The P\'olya group of a number field $K$ is the subgroup $\Po(K)$ of
the class group $\Cl(K)$ generated by the classes of all the Ostrowski ideals $\Pi_q(K)$.
\end{definition}
Hence $K$ is a P\'olya field if and only if $\Po(K)$ is trivial. Obviously every number field with class number one is a P\'olya field, but not conversely. For instance, Zantema proved that every cyclotomic field is a P\'olya field \cite[Proposition 2.6]{Zantema}. The reader is referred to \cite{Cahen-Chabert's book, ChabertI, MR1, MR2, Zantema} for some results on P\'olya fields and P\'olya groups. Recently the notion of P\'olya group has been relativized independently in \cite{MaarefparvarThesis, ChabertI}.
\begin{definition}
For $K/F$ a finite extension of number fields, the \textit{relative P\'olya group} of $K$ over $F$, is the subgroup of $\Cl(K)$ generated by the classes of the \textit{relative Ostrowski ideals}
\begin{align*}
\Pi_{\mathfrak{p}^f}(K/F):=\prod_{\substack{\mathfrak{P}\in \mathbb{P}_K \\ N_{K/F}(\mathfrak{P})=\mathfrak{p}^f}} \mathfrak{P},
\end{align*}
where $\mathfrak{p}$ is a prime ideal of $F$, $f$ is a positive integer and by convention, if $K$ has no ideal with relative norm $\mathfrak{p}^f$ (over $F$), then $\Pi_{\mathfrak{p}^f}(K/F)=\mathcal{O}_K$.
We denote the relative P\'olya group of $K$ over $F$ by $\Po(K/F)$. In particular, $\Po(K/\mathbb{Q})=\Po(K)$ and $\Po(K/K)=\Cl(K)$.
\end{definition}
If $K/F$ is a Galois extension with Galois group $G$, the ideals $\Pi_{\mathfrak{P}^f}(K/F)$ freely generate the ambiguous ideals $I(K)^G$ \cite[Proof of Proposition 2.2]{Brumer-Rosen}. Hence in this case, $\Po(K/F)$ coincides with the group of strongly ambiguous ideal classes of $K/F$. Moreover, using some results of Brumer and Rosen \cite[$\S$2]{Brumer-Rosen}, one may find the following exact sequence which is also obtained by Zantema in the absolute case \cite[$\S$3]{Zantema}.
\begin{proposition} \cite{ChabertI,MR2} \label{theorem, generalization of the Zantema's exact sequence}
For $K/F$ a finite Galois extension of number fields with Galois group $G$, the following sequence is exact:
{\small
\begin{equation*} \label{equation, BRZ exact sequence}
\tag{BRZ}
0 \rightarrow \Ker({\epsilon}_{K/F}) \rightarrow H^1(G,U_K) \rightarrow\bigoplus_{\mathfrak{p} \in \mathbb{P}_F} \frac{\mathbb{Z}}{e_{\mathfrak{p}(K/F)}\mathbb{Z}} \rightarrow \frac{\Po(K/F)}{{\epsilon}_{K/F}(\Cl(F))} \rightarrow 0.
\end{equation*}}
\end{proposition}
\begin{remark}
Note that ``BRZ'' stands for Brumer-Rosen \cite{Brumer-Rosen} and Zantema \cite{Zantema} whose cohomological results are the main tools to prove the above proposition, see \cite[Remark 1.4]{SRM}.
\end{remark}
As a modification of the relative P\'olya group, the notion of ``Ostrowski quotient'' has been recently introduced in \cite{SRM}.
\begin{definition} \label{definition, Ostrowski group}
For $K/F$ a finite extension of number fields, the \textit{Ostrowski quotient} $\Ost(K/F)$ is defined as
\begin{equation} \label{equation, Ostrowski group general case}
\Ost(K/F) := \frac{\Po(K/F)}{\Po(K/F) \cap \epsilon_{K/F}(Cl(F))}.
\end{equation}
In particular, $\Ost(K/\mathbb{Q})=\Po(K/\mathbb{Q})=\Po(K)$ and $\Ost(K/K)=0$. The extension $K/F$ is called \textit{Ostrowski} (or $K$ is called $F$-Ostrowski) whenever $\Ost(K/F)$ is trivial.
\end{definition}
\begin{remark} \label{remark, if L/K is Galois then epsilon of Cl(K) is contained in relative Polya group}
If $K/F$ is Galois, then $\epsilon_{K/F}(\Cl(F)) \subseteq \Po(K/F)$ \cite[$\S$ 2]{MR2}. Hence
\begin{equation} \label{equation, for K/F Galois extension, Ost(K/F) equals to Po(K/F) modulo image of epsilon}
\Ost(K/F)=\frac{\Po(K/F)}{\epsilon_{K/F}(\Cl(F))}.
\end{equation}
\end{remark}
Some applications of \eqref{equation, BRZ exact sequence}, especially generalizations of some results for P\'olya fields, have been found in \cite[$\S2$]{MR2}. Moreover, using \eqref{equation, BRZ exact sequence} one may find simple proofs for some classical well known results in the literature for the capitulation problem \cite[$\S$2.2.1]{SRM}. For more applications of \eqref{equation, BRZ exact sequence}, see \cite{ChabertI,MR2,SRM}.
\section{Localization and transgression maps} \label{section, Localization and transgression maps}
From now on, we fix the following notations:
\begin{itemize}
\item[•]
$K/F$: a finite Galois extension of number fields with Galois group $G$;
\vspace*{0.15cm}
\item[•]
$G_F:=Gal(\overline{F}/F)$, where $\overline{F}$ is the algebraic closure of $F$;
\vspace*{0.15cm}
\item[•]
$M_F$: a complete set of places of $F$;
\vspace*{0.15cm}
\item[•]
$M_F^{\infty}$: the set of all infinite places of $F$;
\vspace*{0.15cm}
\item[•]
$M_F^0$: the set of all finite places of $F$;
\vspace*{0.15cm}
\vspace*{0.15cm}
\item[•]
$F_v$: the completion of $F$ at a place $v \in M_F$;
\vspace*{0.15cm}
\item[•]
$w$: a fixed place of $K$ lying above $v \in M_F$;
\vspace*{0.15cm}
\item[•]
$U_{K_{w}}$: the group of local units in $K_{w}$;
\vspace*{0.15cm}
\item[•]
$G_{w}:=Gal(K_{w}/F_v)$ for a place $v \in M_F$;
\vspace*{0.15cm}
\item[•]
$G_{F_v}:=Gal(\overline{F_v}/F_v)$, where $\overline{F_v}$ is the algebraic closure of $F_v$.
\end{itemize}
\vspace*{0.15cm}
Let $S$ be a finite set of primes of $F$ with $M_F^{\infty} \subseteq S$.
In \cite{Aviles}, Gonz\'alez-Avil\'es found some interesting results on the kernel and cokernel of the \textit{$S$-capitulation map}. Assuming $S=M_F^{\infty}$, we summarize a few results of Gonz\'alez-Avil\'es which we need for the rest of the paper.
\begin{proposition} \cite[$\S$2]{Aviles} \label{proposition, Aviles results}
For $K/F$ a finite Galois extension of number fields with Galois group $G$, the following sequences are exact:
\begin{align}
& 0 \rightarrow P(K)^G \rightarrow I(K)^G \rightarrow \Cl(K)_{\trans}^G \rightarrow 0,
\\
&0 \rightarrow \Cl(K)_{\trans}^G \rightarrow \Cl(K)^G \rightarrow H^1(G, P(K)) \rightarrow 0,
\\
& 0 \rightarrow H^1(G,P(K)) \rightarrow H^2(G,U_K) \rightarrow H^2(G,K^{\times}),
\end{align}
{\footnotesize
\begin{equation} \label{equation, Aviles exact sequence}
0 \rightarrow \Ker({\epsilon}_{K/F}) \rightarrow H^1(G,U_K) \xrightarrow{\lambda} \bigoplus_{v \in M_F^0} H^1(G_w,U_{K_{w}}) \rightarrow \frac{\Cl(K)^G_{\trans}}{\epsilon_{K/F}(\Cl(F))} \rightarrow 0.
\end{equation}}
\end{proposition}
\begin{remark} \label{remark, transgression map in Aviles paper}
The composite $\Cl(K)^G \rightarrow H^1(G,P(K)) \hookrightarrow H^2(G,U_K)$ is called the \textit{transgression map} which we denote it by $\trans_{K/F}$. Also
$\Cl(K)^G_{\trans}$, the kernel of $\trans_{K/F}$, is called \textit{the group of transgressive ambiguous classes}, see \cite[$\S$2]{Aviles}. It must be noted that the transgression map is defined in a more general case as $\Trans_{K/F}:H^1(G_K,U_{\overline{K}})^G \rightarrow H^2(G,U_K)$, see \cite[$\S$3]{Serre} or \cite[$\S$4]{Yu} for the definition (We call both as transgression map and use different notations to avoid confusion).
\end{remark}
Using Proposition \ref{proposition, Aviles results}, we find the following description of relative P\'olya group and Ostrowski quotient.
\begin{corollary} \label{corollary, Po(L/K) coincides with Cl(L)_trans}
For $K/F$ a finite Galois extension of number fields with Galois group $G$, we have
\begin{equation*}
\Po(K/F)=\Cl(K)^G_{\trans} \quad \text{and} \quad \Ost(K/F) \simeq \Coker(\lambda),
\end{equation*}
where
\begin{equation*}
\lambda: H^1(G,U_K) \rightarrow \bigoplus_{\substack{v \in M_F^0}} H^1(G_w,U_{K_{w}})
\end{equation*}
denotes the localization map as in the exact sequence \eqref{equation, Aviles exact sequence}.
\end{corollary}
\begin{proof}
Since $I(K)^G$ is generated by all the relative Ostrowski ideals $\Pi_{\mathfrak{p}^f}(K/F)$, see \cite[proof of Proposition 2.2]{Brumer-Rosen}, $I(K)^G/P(K)^G$ coincides with the relative P\'olya group $\Po(K/F)$. Using \eqref{equation, BRZ exact sequence} and Proposition \ref{proposition, Aviles results}, we conclude that $\Ost(K/F)$ is nothing else than the cokernel of the localization map $\lambda$.
\end{proof}
Due to cohomological analogy between Mordell-Weil groups of elliptic curves and unit groups of number fields, Corollary \ref{corollary, Po(L/K) coincides with Cl(L)_trans} motivates us to investigate the elliptic curve analogue of relative P\'olya group and Ostrowski quotient. To accomplish this, we apply some results of Yu \cite{Yu} for unit groups of number fields. Then switching to elliptic curve setting, under some additional assumptions, we obtain similar results.
\section{On Tate-Shafarevich groups} \label{section, Tate-Shafarevich group}
Keep the same notations introduced in the previous section.
Let $E/F$ be an elliptic curve defined over $F$. By the \textit{Mordell-Weil Theorem} the group of $F$-rational points of $E$, denoted by $E(F)$, is finitely generated. An important tool to study $E(F)$, is the \textit{Tate-Shafarevich group} $\Sha(E/F)$, which measures the failure of the \textit{Hasse local-global principle} for
curves that are \textit{principle homogeneous spaces} for $E/F$. More formally,
$\Sha(E/F)$ is defined to be the group of everywhere locally trivial elements of $H^1(G_F,E(\overline{F}))$ \cite[Chapter X]{Silverman}:
\begin{equation} \label{equation, Tate-Shafarevich group of elliptic curve}
\Sha(E/F):=\Ker\left(H^1(G_F,E(\overline{F})) \rightarrow \bigoplus_{v \in M_F} H^1(G_{F_v},E(\overline{F_v}) \right).
\end{equation}
The famous conjecture of Tate and Shafarevich states that $\Sha(E/K)$ is finite \cite[Conjecture 4.13]{Silverman}. Though it has been shown that if the analytic rank of $E$ is smaller that $2$, then $\Sha(E/K)$ is finite \cite[Theorem 5.12]{Rubin}, but the general case has not yet been proved.
Using the cohomological analogy between the Mordell-Weil group $E(F)$ and the unit group $U_F$, Tate-Shafarevich group of $F$ is defined similarly.
\begin{definition} \cite[$\S$1]{Schoof} \label{definition, Tate-Shafarevich group of number fields}
The ``Tate-Shafarevich group $\Sha(F)$'' of $F$ is defined as
\begin{equation} \label{equation, Tate-Shafarevich group of K}
\Sha(F):= \Ker\left(H^1(G_F,U_{\overline{F}}) \rightarrow \bigoplus_{v \in M_F} H^1(G_{\overline{F}_v},U_{\overline{F}_v}) \right),
\end{equation}
where for non-archimedean $v$ (resp. archimedean $v$), $U_{\overline{F}_v}$ denotes the valuation ring in $\overline{F}_v$ (resp. $U_{\overline{F}_v}=\overline{F}_v^{\times}$).
Note that by Hilbert's Theorem 90, $\Sha(F)$ can be defined just in term of the non-archimedean places of $F$.
\end{definition}
Despite Tate-Shafarevich conjecture for elliptic curves is still open, the situation for number fields is more understandable.
\begin{proposition} \cite[Proposition 1]{Schoof} \label{proposition, the Tate-Shafarevich group of K is isomorphic to the ideal class group of K}
$\Sha(F)$ is canonically isomorphic to the ideal class group of $F$. In particualr, $\Sha(F)$ is finite.
\end{proposition}
Replacing $\overline{F}$ with a finite Galois extension of $F$, one obtains the following notion.
\begin{definition} \cite[$\S$1]{Schoof}
Let $K/F$ be a finite Galois extension of number fields with Galois group $G$. The \textit{locally trivial cohomology group} $H^1_{lt}(G,U_K)$ is defined as
\begin{equation} \label{equation, definition of H^1_lt}
H^1_{lt}(G,U_K):=\Ker \left(H^1(G,U_K) \rightarrow \bigoplus_{v \in M_F} H^1(G_{w},U_{K_{w}})\right),
\end{equation}
where for each $v \in M_F$, $w$ is a fixed place of $K$ lying above $v$.
\end{definition}
\begin{proposition} \cite[Corollary of Proposition 1]{Schoof} \label{proposition, Schoof-Washington result that Ker(epsilon) is isomorphic to H^1_lt}
Let $K/F$ be a finite Galois extension of number fields with Galois group $G$. Then
\begin{equation} \label{equation, isomorphism between kernel of epsilon and H^1_lt}
\Ker(\epsilon_{K/F}) \simeq H^1_{lt}(G,U_K),
\end{equation}
where $\epsilon_{K/F}:\Cl(F) \rightarrow \Cl(K)^G$ denotes the capitulation map.
\end{proposition}
\begin{remark}
Note that isomorphism \eqref{equation, isomorphism between kernel of epsilon and H^1_lt} is also obtained from Gonz\'alez-Avil\'es exact sequence \eqref{equation, Aviles exact sequence}.
\end{remark}
\section{Relative Polya group as image of the restriction map}
As before, we use the notations introduced in Section \ref{section, Localization and transgression maps}.
So let $K/F$ be a finite Galois extension of number fields with Galois group $G$. Replacing unit groups with rational points of elliptic curves, considered in Yu's paper \cite{Yu}, one obtains the following commutative diagram:
\begin{equation} \label{equation, commutative diagram for unit groups}
{\scriptsize
\begin{tikzcd}
0 \arrow[r] & H^1(G,U_K) \arrow[r, "\Inf_{K/F}"] \arrow[d,"\overline{\mathcal{F}}"]
& H^1(G_F,U_{\overline{F}}) \arrow[d, "\overline{\mathcal{G}}"] \arrow[r, "\Res_{K/F}"] & \Image(\Res_{K/F}) \arrow[d, "\overline{\mathcal{H}}"] \arrow[r] & 0\\
0 \arrow[r] & \bigoplus_{v \in M_F} H^1(G_w,U_{K_w}) \arrow[r]
& \bigoplus_{v \in M_F} H^1(G_{F_v},U_{\overline{F}_v}) \arrow[r] & \bigoplus_{v \in M_F} H^1(G_{K_w},U_{\overline{K}_w}),
\end{tikzcd}
}
\end{equation}
where $\Inf_{K/F}$ denotes the inflation map and $\Res_{K/F}:H^1(G_F,U_{\overline{F}}) \rightarrow H^1(G_K,U_{\overline{K}})^G$ denotes the restriction map.
Using the snake lemma, we find the following exact sequence:
\begin{equation} \label{equation, exact sequence obtained from commutative diagram for unit groups}
0 \rightarrow \Ker(\overline{\mathcal{F}}) \rightarrow \Ker(\overline{\mathcal{G}}) \rightarrow \Ker(\overline{\mathcal{H}}) \rightarrow \Coker(\overline{\mathcal{F}}) \rightarrow \overline{\mathcal{I}}\left(\Coker(\overline{\mathcal{F}})\right) \rightarrow 0,
\end{equation}
where
\begin{equation} \label{equation, map I-bar in commutative diagram for unit groups}
\overline{\mathcal{I}}:\Coker(\overline{\mathcal{F}}) \rightarrow \Coker(\overline{\mathcal{G}})
\end{equation}
is the map obtained from diagram \eqref{equation, commutative diagram for unit groups}. By Propositions \ref{proposition, Schoof-Washington result that Ker(epsilon) is isomorphic to H^1_lt} and \ref{proposition, the Tate-Shafarevich group of K is isomorphic to the ideal class group of K} we have $ \Ker(\overline{\mathcal{F}}) \simeq \Ker(\epsilon_{K/F})$ and $\Ker(\overline{\mathcal{G}}) \simeq \Cl(F)$, respectively. Hence \eqref{equation, exact sequence obtained from commutative diagram for unit groups} is equivalent to the following exact sequence:
\begin{equation} \label{equation, exact sequence obtained from commutative diagram for unit groups in term of class group}
0 \rightarrow \Ker(\epsilon_{K/F}) \rightarrow \Cl(F) \rightarrow \Ker(\overline{\mathcal{H}}) \rightarrow \Coker(\overline{\mathcal{F}}) \rightarrow \overline{\mathcal{I}}\left(\Coker(\overline{\mathcal{F}})\right) \rightarrow 0.
\end{equation}
\begin{lemma} \label{lemma, Ker(g bar)=Cl(F), Ker(F bar)=Ker(epsilon) and Ker(H bar)=Po(K/F)}
With the notations of this section, one has
$\Ker(\overline{\mathcal{H}}) \simeq \Po(K/F)$.
\end{lemma}
\begin{proof}
In \cite[$\S$4, Theorem 2]{Serre} it is proved that $\Image(\Res_{K/F})=\Ker(\Trans_{K/F})$, where
$\Trans_{K/F}:H^1(G_K,U_{\overline{K}})^G \rightarrow H^2(G,U_K)$ denotes the transgression map. Hence by Proposition \ref{proposition, the Tate-Shafarevich group of K is isomorphic to the ideal class group of K}, we have
\begin{equation*}
\Ker(\overline{\mathcal{H}})=\Ker(\Trans_{K/F}) \cap \Cl(K)^G=\Ker(\trans_{K/F})=\Cl(K)_{\trans}^G,
\end{equation*}
where $\Cl(K)_{\trans}^G$ denotes the group of transgressive ambiguous classes, see Remark \ref{remark, transgression map in Aviles paper}. Corollary \ref{corollary, Po(L/K) coincides with Cl(L)_trans} completes the proof.
\end{proof}
\iffalse
\begin{remark}
Note that Lemma \ref{lemma, Ker(g bar)=Cl(F), Ker(F bar)=Ker(epsilon) and Ker(H bar)=Po(K/F)} reveals some fundamental properties for number fields which may not hold for elliptic curves in general:
\begin{itemize}
\item $\Ker(\overline{\mathcal{G}})$, called the \textit{Tate-Shafarevich group} of $F$, is finite for \textit{any} number field $F$, although proving (or disproving) finiteness of Tate-Shafarevich group of elliptic curves is a prominent open conjecture, see e.g. \cite[Conjecture 5.11]{Rubin}.
\vspace*{0.2cm}
\item Taking $F=\mathbb{Q}$, one can show that for \textit{any} fintie Galois extension $K/\mathbb{Q}$ the group $\Ker(\overline{\mathcal{H}})$ would be \textit{computable} \cite[Corollary 4.5]{ChabertII}. Indeed, $\Ker(\overline{\mathcal{H}})$ can be explicitly determined in term of \textit{ambiguous ideal classes} of $K/\mathbb{Q}$, see Lemma \ref{lemma, Pol(K/F) coincides with Ker(trans_{K/F})} above, as Hilbert did for quadratic number fields \cite[Theorem 105-106]{Hilbert's book}.
However, to the best of our knowledge, there are few results in a similar situation for elliptic curves, see the next section.
\end{itemize}
\end{remark}
\fi
\begin{theorem} \label{theorem, the map I is zero for number field case}
Let $K/F$ a finite Galois extension of number fields with Galois group $G$. For the localization maps
\begin{equation*}
\overline{\mathcal{F}} :H^1(G,U_K) \rightarrow \bigoplus_{v \in M_F} H^1(G_w,U_{K_w})
\end{equation*}
and
\begin{equation*}
\overline{\mathcal{G}}: H^1(G_F,U_{\overline{F}}) \rightarrow \bigoplus_{v \in M_F} H^1(G_w,U_{K_w}),
\end{equation*}
the map
\begin{equation*}
\overline{\mathcal{I}}:\Coker(\overline{\mathcal{F}}) \rightarrow \Coker(\overline{\mathcal{G}})
\end{equation*}
obtaining from diagram \eqref{equation, commutative diagram for unit groups},
is the zero map.
\end{theorem}
\begin{proof}
By Lemma \ref{lemma, Ker(g bar)=Cl(F), Ker(F bar)=Ker(epsilon) and Ker(H bar)=Po(K/F)}, one can rewrite exact sequence \eqref{equation, exact sequence obtained from commutative diagram for unit groups in term of class group} as
\begin{equation*} \label{equation, exact sequence equivalent to the one obtained from diagram for unit groups}
0 \rightarrow \Ker(\epsilon_{K/F}) \rightarrow \Cl(F) \rightarrow \Po(K/F) \rightarrow \Coker(\overline{\mathcal{F}}) \rightarrow \overline{\mathcal{I}}\left(\Coker(\overline{\mathcal{F}})\right) \rightarrow 0.
\end{equation*}
Equivalently, the sequence
\begin{equation*}
0 \rightarrow \epsilon_{K/F}\left(\Cl(F)\right) \rightarrow \Po(K/F) \rightarrow \Coker(\overline{\mathcal{F}}) \rightarrow \overline{\mathcal{I}}\left(\Coker(\overline{\mathcal{F}})\right) \rightarrow 0
\end{equation*}
is exact. By Corollary \ref{corollary, Po(L/K) coincides with Cl(L)_trans} we have $\Ost(K/F) \simeq \Coker(\overline{\mathcal{F}})$, hence $\overline{\mathcal{I}}$ must be the zero map.
\end{proof}
Now we are ready to discuss on elliptic curve analogue of relative P\'olya group and Ostrowski quotient.
\section{Main Results}
\textbf{Convention.} We keep the same notations introduced in Section \ref{section, Localization and transgression maps}. Throughout this section, $E/F$ denotes an elliptic curve defined over $F$ for which the Tate-Shafarevich groups $\Sha(E/F)$ and $\Sha(E/K)$ are finite.
\begin{proposition} \cite[Theorem 1]{Yu} \label{proposition, global duality theorem restated by Yu}
For $E/F$ an elliptic curve defined over $F$, the following sequence is exact:
\begin{equation} \label{equation, Yu exact sequence}
0 \rightarrow \Sha(E/F) \rightarrow H^1(G_F,E) \xrightarrow{\mathcal{G}} \bigoplus_{v \in M_F} H^1(G_{F_v},E) \rightarrow \widehat{E(F)}^* \rightarrow 0,
\end{equation}
where $\widehat{E(F)}$ denotes the completion of $E(F)$ with respect to the topology defined by the subgroups of finite index, and $\widehat{E(F)}^*$ denotes the group of continuous characters of finite order of $\widehat{E(F)}$, i.e. $\widehat{E(F)}^*=\Hom_{\cts}(\widehat{E(F)},\mathbb{Q}/\mathbb{Z})$.
\end{proposition}
\begin{remark}
The last term in the original form of the exact sequence \eqref{equation, Yu exact sequence} appears based on the \textit{dual} of abelian varieties \cite[Theorem 1]{Yu}, whereas in the exceptional case the dual of an elliptic curve E will be isomorphic to $E$ itself. More percisely, in the characteristic zero, the dual of an abelian variety $A$ is isomorphic to the ``degree zero divisor group $\Pic^0(A)$'' of $A$ \cite[$\S$8]{Mumford}, and for an elliptic curves $E$ one has $\Pic^0(E) \simeq E$
\cite[Chapter III, Proposition 3.4]{Silverman}.
\end{remark}
Similar to number field case and following Yu \cite[$\S$2]{Yu}, consider the commutative diagram
\begin{equation} \label{equation, Yu commutative diagram}
{\scriptsize
\begin{tikzcd}
0 \arrow[r] & H^1(G,E(K)) \arrow[r, "\Inf_{K/F}^E"] \arrow[d,"\mathcal{F}"]
& H^1(G_F,E) \arrow[d, "\mathcal{G}"] \arrow[r, "\Res^E_{K/F}"] & \Image(\Res^E_{K/F}) \arrow[d, "\mathcal{H}"] \arrow[r] & 0\\
0 \arrow[r] & \bigoplus_{v \in M_F} H^1(G_{w},E(K_w) \arrow[r, "\eta"]
& \bigoplus_{v \in M_F} H^1(G_{F_v},E) \arrow[r, "\theta"] & \bigoplus_{v \in M_F} H^1(G_{K_{w}},E),
\end{tikzcd}
}
\end{equation}
where $\Inf_{K/F}^E$ denotes the inflation map and
\begin{equation} \label{equation, restriction map for E/K and E/L}
\Res_{K/F}^E:H^1(G_F,E) \rightarrow H^1(G_K,E)^G
\end{equation}
denotes the restriction map. Using the snake lemma, we find the sequence
\begin{equation} \label{equation, exact sequence obtained from Yu commutative diagram}
0 \rightarrow \Ker(\mathcal{F}) \rightarrow \Sha(E/F) \xrightarrow{\widetilde{\Res}_{K/F}^E} \Ker(\mathcal{H}) \rightarrow \Coker(\mathcal{F}) \rightarrow \mathcal{I}\left(\Coker(\mathcal{F})\right) \rightarrow 0,
\end{equation}
is exact, where
\begin{equation*}
\widetilde{\Res}_{K/F}^E:=\Res_{K/F}^E\mid_{\Sha(E/F)}: \Sha(E/F) \rightarrow H^1(G_K,E)^G
\end{equation*}
and
\begin{equation} \label{equation, map I in Yu paper}
\mathcal{I}:\Coker(\mathcal{F}) \rightarrow \Coker(\mathcal{G})
\end{equation}
is the map obtained from the above diagram. Let
\begin{equation} \label{equation, transgression map in Yu papaer}
\Trans^E_{K/F}: H^1(G_K,E)^G \rightarrow H^2(G,E(K))
\end{equation}
be the transgression map, see Remark \ref{remark, transgression map in Aviles paper}. From \cite[$\S$4, Theorem 2]{Serre} we have
\begin{equation} \label{equation, Image(ResK/FE)=Ker(TransK/FE)}
\Image\left(\Res_{K/F}^E\right)=\Ker\left(\Trans^E_{K/F}\right).
\end{equation}
\begin{lemma} \label{lemma, isomorphism between Ker(epsilon-tilda) and Ker(F)}
With the notations of this section,
\begin{equation} \label{equation, image of res-tilda is contained in Sha(E/L)^G}
\Image(\widetilde{\Res}_{K/F}^E) \subseteq \Sha(E/K)^G,
\end{equation}
and
\begin{equation} \label{equation, Ker(epsilon-tilda) and Ker(F) are isomorphic}
\Ker(\widetilde{\Res}_{K/F}^E) \simeq \Ker(\mathcal{F}).
\end{equation}
\end{lemma}
\begin{proof}
Using exact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram}, equation \eqref{equation, Image(ResK/FE)=Ker(TransK/FE)} and equality
\begin{equation} \label{equation, kernel of H}
\Ker(\mathcal{H}) = \Sha(E/K)^G \cap \Ker(\Trans^E_{K/F}),
\end{equation}
see \cite[page 213]{Yu}, we obtain the containment \eqref{equation, image of res-tilda is contained in Sha(E/L)^G}. Eexact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram} also implies that
\begin{equation*}
\Ker(\mathcal{F}) \simeq \Ker(\widetilde{\Res}_{K/F}^E).
\end{equation*}
\end{proof}
\begin{remark}
By Lemma \eqref{lemma, isomorphism between Ker(epsilon-tilda) and Ker(F)}, the map $\widetilde{Res}_{K/F}^E$ can be written as
\begin{equation} \label{equation, res-tilda}
\widetilde{\Res}_{K/F}^E: \Sha(E/F) \rightarrow \Sha(E/K)^G,
\end{equation}
which is the analogue of the capitulation map $\epsilon_{K/F}:\Cl(F) \rightarrow \Cl(K)^G$ as in \cite[$\S$2]{Aviles}. Moreover, the isomorphism \eqref{equation, Ker(epsilon-tilda) and Ker(F) are isomorphic},
may be thought as the analogue of Schoof-Washington result in Proposition \ref{proposition, Schoof-Washington result that Ker(epsilon) is isomorphic to H^1_lt}.
\end{remark}
Similar to the transgression map $\trans_{K/F}$ mentioned in Remark \ref{remark, transgression map in Aviles paper}, let
\begin{equation} \label{equation, definition of trans-tilda for Tate-Shafarevich groups}
\trans^E_{K/F}:=\Trans^E_{K/F}|_{\Sha(E/K)^G}:\Sha(E/K)^G \rightarrow H^2(G,E(K)).
\end{equation}
By equation \eqref{equation, kernel of H}, we have
\begin{equation} \label{equation, ker(H) is equal to ker(trans-tilda)}
\Ker(\mathcal{H})=\Ker(\trans^E_{K/F}),
\end{equation}
and exact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram} yields
\begin{equation} \label{equation, image of res-tilda is contained into ker(trans-tilda)}
\Image(\widetilde{\Res}^E_{K/F}) \subseteq \Ker(\trans^E_{K/F}).
\end{equation}
\begin{theorem} \label{theorem, our main result}
Let $E/F$ be an elliptic curve defined over $F$ and $K/F$ a finite Galois extension of number fields with Galois group $G$. Then the following statements are equivalent.
\begin{itemize}
\item[(i)] The sequence
{\small
\begin{equation*} \label{equation, EC-BRZ} \tag{EC-BRZ}
0 \rightarrow \Ker\left(\widetilde{\Res}_{K/F}^E\right) \rightarrow H^1\left(G,E(K)\right) \xrightarrow{\mathcal{F}} \bigoplus_{v \in M_F} H^1\left(G_w,E(K_w)\right) \rightarrow \frac{\Ker(\trans^E_{K/F})}{\Image\left(\widetilde{\Res}_{K/F}\right)} \rightarrow 0
\end{equation*}}
is exact.
\item[(ii)]
The map $\mathcal{I}:\Coker(\mathcal{F}) \rightarrow \Coker(\mathcal{G})$ as in \eqref{equation, map I in Yu paper}, is the zero map.
\item[(iii)] The localization map
\begin{equation} \label{equation, map F0prime for elliptic curves}
\mathcal{F}_0:\widehat{H}^0(G,E(K)) \rightarrow \prod_{v \in M_F} \widehat{H}^0\left(G_w,E(K_w)\right)
\end{equation}
is the zero map.
\end{itemize}
In particular, if $\widehat{E(F)}$, introduced in Proposition \ref{proposition, global duality theorem restated by Yu}, is trivial
then \eqref{equation, EC-BRZ} is exact.
\end{theorem}
\begin{proof}
By Lemma \eqref{lemma, isomorphism between Ker(epsilon-tilda) and Ker(F)}, we have
\begin{equation*}
\Ker(\widetilde{\Res}_{K/F}^E) \simeq \Ker(\mathcal{F}).
\end{equation*}
Hence sequence \eqref{equation, EC-BRZ} is exact if and only if
\begin{equation*}
\frac{\Ker(\trans^E_{K/F})}{\Image\left(\widetilde{\Res}_{K/F}\right)} \simeq \Coker(\mathcal{F}).
\end{equation*}
By exact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram} and equality \eqref{equation, ker(H) is equal to ker(trans-tilda)}, the last isomorphism holds if and only if $ \mathcal{I}\left(\Coker(\mathcal{F})\right)=0$ (Thanks to Yu's computations \cite[$\S$2]{Yu}). Also in \cite[Lemma 5]{Yu} it is proved that $\# \Image(\mathcal{I})=\#\Image\left(\mathcal{F}_0\right)$ which implies that the last two assertions are equivalent.
Finally by Proposition \eqref{proposition, global duality theorem restated by Yu}, one has
\begin{equation*}
\Image(\mathcal{I}) \subseteq \Coker(\mathcal{G}) \simeq \widehat{E(F)}^*.
\end{equation*}
\end{proof}
\begin{remark} \label{remark, EC-BRZ stands for}
Note that ``EC-BRZ'' stands for the \textit{Elliptic Curve analogue of} \eqref{equation, BRZ exact sequence}.
Indeed comparing \eqref{equation, EC-BRZ} with Gonz\'alez-Avil\'es exact sequence \eqref{equation, Aviles exact sequence}, which is equivalent to \eqref{equation, BRZ exact sequence}, one may consider $\Ker(\trans^E_{K/F})$ and $\frac{\Ker(\trans^E_{K/F})}{\Image\left(\widetilde{\Res}_{K/F}\right)}$ as elliptic curve analogues of relative P\'olya group $\Po(K/F)$ and Ostrowski quotient $\Ost(K/F)$, respectively.
\end{remark}
\begin{corollary} \label{corollary, Ker(I) is isomorphic to Ostrowski quotient for elliptic curves}
With the assumptions and notations of Theorem \ref{theorem, our main result}, one has
\begin{equation*}
\Ker(\mathcal{I}) \simeq \frac{\Ker(\trans^E_{K/F})}{\Image\left(\widetilde{\Res}_{K/F}\right)}.
\end{equation*}
\end{corollary}
\begin{proof}
Using exact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram} and Lemma \ref{lemma, isomorphism between Ker(epsilon-tilda) and Ker(F)} we find the sequence
{\small
\begin{equation*}
0 \rightarrow \Ker\left(\widetilde{Res}_{K/F}^E\right) \rightarrow \Sha(E/F) \rightarrow \Ker(\trans^E_{K/F}) \rightarrow \Coker(\mathcal{F}) \xrightarrow{\mathcal{I}} \Image(\mathcal{I}) \rightarrow 0,
\end{equation*} }
is exact. Equivalently, we have the following exact sequence
{\small
\begin{equation*}
0 \rightarrow \Image\left(\widetilde{Res}_{K/F}^E\right) \rightarrow \Ker(\trans^E_{K/F}) \rightarrow \Coker(\mathcal{F}) \xrightarrow{\mathcal{I}} \Image(\mathcal{I}) \rightarrow 0,
\end{equation*} }
and the assertion is proved.
\end{proof}
\begin{corollary} \label{corollary, if the norm map is surjective then the analogue of BRZ is exact}
With the assumptions and notations of Theorem \ref{theorem, our main result}, if the norm map
\begin{align*}
N_{K/F}^E: E(K) & \rightarrow E(F) \\
P & \mapsto \sum_{\sigma \in G} \sigma(P)
\end{align*}
is surjective, e.g. if $E(F)=0$, then
\begin{itemize}
\item[(1)]
\eqref{equation, EC-BRZ} is exact;
\item[(2)] for $G$ cyclic, $\Ker(\trans^E_{K/F})=\Sha(E/K)^G$.
\end{itemize}
\end{corollary}
\begin{proof}
(1) Since the norm map $N_{K/F}^E$ is surjective, we have
\begin{equation*}
\widehat{H}^0(G,E(K))=\frac{E(F)}{N_{K/F}^E(E(K))}=0.
\end{equation*}
Hence the localization map $\mathcal{F}_0$ \eqref{equation, map F0prime for elliptic curves}
is zero and exactness of \eqref{equation, EC-BRZ} follows from Theorem \ref{theorem, our main result}.
(2) Since $K/F$ is cyclic, we have
\begin{equation*}
H^2(G,E(K))=\widehat{H}^0(G,E(K))=0.
\end{equation*}
Therefore the transgression map $\trans^E_{K/F}$ \eqref{equation, definition of trans-tilda for Tate-Shafarevich groups} is the zero map.
\end{proof}
\begin{remark} \label{Remark, if the norm map on units is surjective}
Applying the same above reasoning for the transgression map $\trans_{K/F}$, appeared in Remark \ref{remark, transgression map in Aviles paper},
one can obtain the number field analogue of part (2) of Corollary \ref{corollary, if the norm map is surjective then the analogue of BRZ is exact}, i.e., if $K/F$ is cyclic and the norm map $N_{K/F}:U_K \rightarrow U_F$ is surjective, then $\Po(K/F)=\Cl(K)^G$. Note that by Corollary \ref{corollary, Po(L/K) coincides with Cl(L)_trans}, $\Po(K/F)=\Ker\left(\trans_{K/F}\right)$.
\end{remark}
\begin{corollary} \label{corollary, order of the quotient of ker(trans-tilda) over Sha(E/K)}
With the assumptions and notations of Theorem \ref{theorem, our main result}, if \eqref{equation, EC-BRZ} is exact, then
\begin{equation} \label{equation, order of ker(trans-tilda)}
\frac{\# \Ker(\trans^E_{K/F})}{\# \Sha(E/F)}=\frac{\prod_{v \in M_F} \# H^1\left(G_{w},E(K_{w})\right)}{\# H^1\left(G,E(K)\right)}.
\end{equation}
Furthermore, $\trans^E_{K/F}$ is the zero map if and only if
\begin{equation*}
\frac{\# \Sha(E/K)^G}{\# \Sha(E/F)}=\frac{\prod_{v \in M_F} \# H^1\left(G_{w},E(K_{w})\right)}{\# H^1\left(G,E(K)\right)}.
\end{equation*}
\end{corollary}
\begin{proof}
Immediately follows from Theorem \ref{theorem, our main result}.
\end{proof}
As a generalization of the main theorem in \cite{Aviles2000}, Yu obtained the following result.
\begin{proposition} \cite[Corollary 7]{Yu} \label{proposition, Yu result for generalization of Aviles result}
Let $E/F$ be an elliptic curve defined over $F$ and $K/F$ a finite Galois extension of number fields with Galois group $G$. If
\begin{equation*}
\widehat{H}^0(G,E(K))=H^2\left(G,E(K)\right)=0,
\end{equation*}
then
\begin{equation*}
\frac{\# \Sha(E/K)^G}{\# \Sha(E/F)}=\frac{\prod_{v \in M_F} \# H^1\left(G_{w},E(K_{w})\right)}{\# H^1\left(G,E(K)\right)}.
\end{equation*}
\end{proposition}
\begin{remark}
If $\widehat{H}^0(G,E(K))=0$, then the localization map $\mathcal{F}_0$ \eqref{equation, map F0prime for elliptic curves} is zero, so \eqref{equation, EC-BRZ} is exact by Theorem \ref{theorem, our main result}. Also
triviality of $H^2\left(G,E(K)\right)$ implies that the map $\trans^E_{K/F}$ \eqref{equation, definition of trans-tilda for Tate-Shafarevich groups} is the zero map. Whereas, the converse of these statements may not hold in general. Therefore, Corollary \eqref{corollary, order of the quotient of ker(trans-tilda) over Sha(E/K)} can be thought as a generalization of Proposition \eqref{proposition, Yu result for generalization of Aviles result} and \cite[Main Theorem]{Aviles2000}. Consequently, the family of elliptic curves suggested by Gonz\'alez-Avil\'es \cite[$\S$1]{Aviles2000} satisfy in equivalent assertions of Theorem \ref{theorem, our main result}. In other words, for $E/\mathbb{Q}$ an elliptic curve defined over $\mathbb{Q}$ given by a Weierstrass equation of negative discriminant and $K/\mathbb{Q}$ a finite Galois extension for which $E(K)$ is finite of order prime to $[K:\mathbb{Q}]$, \eqref{equation, EC-BRZ} is exact. In contrast, one can find examples of elliptic curves over finite Galois extensions of number fields, for which \eqref{equation, EC-BRZ} is not exact, see Example \ref{example, EC-BRZ is not exact} below. Hence \eqref{equation, EC-BRZ} needs further investigation which might be an interesting subject for number theorists.
\end{remark}
\subsection{EC-BRZ for elliptic curves over quadratic extensions} \label{section, EC-BRZ for quadratic extensions}
\iffalse
\begin{theorem}
For $K/F$ a finite cyclic extension of number fields, and $E/F$ an elliptic curve defined over $F$,
\begin{itemize}
\item[(1)] if $K/F$ is Ostrowski, e.g. if $K/F$ is unramified at all finite places of $F$, and the norm map $\mathcal{N}_{K/F}:U_K \rightarrow U_F$ is surjective, then the capitulation map $\epsilon_{K/F}:\Cl(F) \rightarrow (\Cl(K))^G$ is also surjective;
\item[(2)] Assume that $E$ has good reduction at all places of $F$.
If the norm map $N^E_{K/F}:E(K) \rightarrow E(F)$ is surjective, then so is the restriction map $\widetilde{res}^E_{K/F}:\Sha(E/F) \rightarrow \Sha(E/K)^G$.
\end{itemize}
\end{theorem}
\begin{proof}
Since the norm map $\mathcal{N}_{K/F}$ is surjective, $\Po(K/F)=(\Cl(K))^G$, see Remark \ref{Remark, if the norm map on units is surjective}. On the other hand, $\epsilon_{K/F}(\Cl(F))=\Po(K/F)$ (because $K/F$ is Ostrowski) and part (1) is proved. Using \eqref{equation, EC-BRZ} and Corollary \ref{corollary, if the norm map is surjective then the analogue of BRZ is exact}, part (2) is similarly proved.
\end{proof}
\fi
In this section, using some results of Qiu \cite{Qiu} and Yu \cite{Yu},
for a quadratic extension $K=F(\sqrt{D})$ (with $D\in F^{\times}/F^{\times^2}$) and an elliptic curve
\begin{equation*}
E/F: y^2=x^3+ax+b \, (\, a,b \in F),
\end{equation*}
we obtain a few results concerning $\Ker(\trans^E_{K/F})$, which is considered as the elliptic curve analogue of $\Po(K/F)$, see Remark \ref{remark, EC-BRZ stands for}.
\iffalse
Throughout this section, we will use some notations introduced in \cite{Qiu} as follows:
\begin{itemize}
\item
$G=Gal(K/F)=<\sigma>$;
\vspace*{0.15cm}
\item
$E_D: y^2=x^3+aD^2x+bD^3$, the \textit{quadratic $D$-twist of $E$};
\item
$r_F=\text{rank}\left(E(F)\right)$;
\vspace*{0.15cm}
\item
$r_{D,F}=\text{rank}\left(E_D(F)\right)$;
\vspace*{0.15cm}
\item
$r_K=\text{rank}\left(E(K)\right)$;
\vspace*{0.15cm}
\item
$\Delta(E)$: the discriminant of $E$ over $F$;
\vspace*{0.15cm}
\item
$M_F$: a complete set of places of $F$;
\vspace*{0.15cm}
\item
$M_F^{\infty}$ : the set of all archimedean places of $F$;
\vspace*{0.15cm}
\item
$M_F^0$ : the set of all non-archimedean places of $F$;
\vspace*{0.15cm}
\item
$S= \{v \in M_F^0 \, : \, v \, \text{is ramified in} \, K \, \text{or} \, E \, \text{has bad reduction at} \, v \}$;
\vspace*{0.15cm}
\item
$S_0=\{v \in S : v \, \text{is ramified on inertial in} \, K \}$.
\end{itemize}
\begin{remark}
With the above notations, $E(K)\simeq E_D(K)$, $\Sha(E_D/K) \simeq \Sha(E/K)$, and $r_F+r_{D,F}=r_K$, see \cite[$\S$1]{Qiu}.
\end{remark}
\fi
\begin{theorem} \label{theorem, order of ker(trans-tilde)}
For a number field $F$, let $E/F$ be an elliptic curve and $K=F(\sqrt{D})$ be a quadratic extension of $F$ with $Gal(K/F)=<\sigma>$. Denote by $E_D$ the quadratic $D$-twist of $E$. If the Tate-Shafarevich groups $\Sha(E/F)$, $\Sha(E_D/F)$ and $\Sha(E/K)$ are finite and \eqref{equation, EC-BRZ} is exact, then
\begin{equation} \label{equation, order of ker(transE,K/F)}
\# \Ker(\trans^E_{K/F})= \frac{\# \Sha(E/K). \left(E(F):N^E_{K/F}(E(K)) \right)}{\#\Sha(E_D/F)},
\end{equation}
where $N^E_{K/F}\left(E(K)\right) =\{P+ \sigma(P) : P \in E(K)\}$.
\end{theorem}
\begin{proof}
From \eqref{equation, EC-BRZ} we have
\begin{equation} \label{equation, order of trans-tilde from our exact sequence}
\# \Ker(\trans^E_{K/F})=\frac{\# \Sha(E/F).\prod_{v \in M_F} H^1\left(G_w,E(K_w)\right)}{\# H^1\left(G,E(K)\right)}.
\end{equation}
On the other hand, under finiteness assumption of Tate-Shafarevich groups, Yu \cite[Main Theorem]{Yu} proved
\begin{equation} \label{equation, Yu's main theorem}
\frac{\# \Sha(E/F). \# \Sha(E_D/F)}{\# \Sha(E/K)}=\frac{ \# \widehat{H}^0(G,E(K)). \# H^1(G,E(K))}{\prod_{v \in M_F} \# H^1\left(G_w,E(K_w)\right)}.
\end{equation}
Since $\#\widehat{H}^0(G,E(K))=\left(E(F):N^E_{K/F}(E(K))\right)$, using equations \eqref{equation, order of trans-tilde from our exact sequence} and \eqref{equation, Yu's main theorem} we obtain the desired equality.
\end{proof}
Note that the exactness of \eqref{equation, EC-BRZ} is a necessary condition in Theorem \ref{theorem, order of ker(trans-tilde)}.
\begin{example} \label{example, EC-BRZ is not exact}
For the elliptic curve
\begin{equation*}
E/\mathbb{Q}: y^2=x^3-x+1/4
\end{equation*}
and the imaginary quadratic field $K=\mathbb{Q}(\sqrt{D})$ with
\begin{align*}
D \in \{&-7,-11,-47,-71,-83,-84,-127,-159,-164,-219,-231,\\
& -263,-271,-287,-292,-303,-308,-359,-371,-404,-443,-447,-471
\},
\end{align*}
we have $\Sha(E/K)=\Sha(E_D/\mathbb{Q})=0$ and $\left(E(\mathbb{Q}):N^E_{K/\mathbb{Q}}(E(K))\right)=2$, see \cite[part (2) of Theorem 4.1]{Qiu}. In particular, $ \Ker(\trans^E_{K/\mathbb{Q}})=0$ and equality \eqref{equation, order of ker(transE,K/F)} doesn't hold. Hence by Theorem \ref{theorem, order of ker(trans-tilde)}, we conclude that for the given elliptic curve $E/\mathbb{Q}$ and the imaginary quadratic fields $K$, \eqref{equation, EC-BRZ} can not be exact.
Using exact sequence \eqref{equation, exact sequence obtained from Yu commutative diagram} and equality \eqref{equation, ker(H) is equal to ker(trans-tilda)}, we find the map
\begin{equation*}
\mathcal{I}:\Coker(\mathcal{F}) \rightarrow \Coker(\mathcal{G})
\end{equation*}
as in \eqref{equation, map I in Yu paper},
is injective. Since \eqref{equation, EC-BRZ} is not exact, Theorem \ref{theorem, our main result} shows that $\mathcal{I}$ is a nonzero map.
By \cite[Lemma 5]{Yu}, one has
\begin{equation*}
\# \Coker(\mathcal{F})=\# \Image(\mathcal{I}) \leq \# \widehat{H}^0(G,E(K))= \left(E(\mathbb{Q}):N^E_{K/\mathbb{Q}}(E(K))\right)=2.
\end{equation*}
Therefore
\begin{equation*}
\Coker(\mathcal{F}) \simeq \mathcal{I}(\Coker(\mathcal{F})) \simeq \mathbb{Z}/2\mathbb{Z} \hookrightarrow \Coker(\mathcal{G}) \simeq \widehat{E(\mathbb{Q})}^*=\Hom_{\cts}(\widehat{E(\mathbb{Q})},\mathbb{Q}/\mathbb{Z}),
\end{equation*}
where $\widehat{E(\mathbb{Q})}$ is defined as in Proposition \ref{proposition, global duality theorem restated by Yu}. Note that $E(\mathbb{Q}) \simeq \mathbb{Z}$, see \cite[proof of Theorem 4.1]{Qiu}.
\end{example}
\begin{proposition} \cite[$\S$1--2]{Qiu} \label{proposition, Qiu results}
Let $E/F$ be an elliptic curve defined over $F$, and $K=F(\sqrt{D})$ be a quadratic extension of $F$ with $G=Gal(K/F)=<\sigma>$. Denote by $E_D$ the quadratic $D$-twist of $E$. Also denote by $r_F$ and $r_{D,F}$ the $\mathbb{Z}$-rank of $E(F)$ and $E_D(F)$, respectively.
Then the following assertions hold.
\begin{itemize}
\item[(i)] $2E(F) \subseteq N^E_{K/F}\left(E(K)\right) \subseteq E(F)$, where
\begin{equation*}
N^E_{K/F}\left(E(K)\right) =\{P+ \sigma(P) : P \in E(K)\}.
\end{equation*}
\vspace*{0.25cm}
\item[(ii)] $\# H^1\left(G,E(K)\right)= 2^{r_{D,F}-r_F}.\left(E(F): N^E_{K/F}(E(K))\right)$.
\vspace*{0.25cm}
\item[(iii)] If $\Sha(E/F)$, $\Sha(E_D/F)$ and $\Sha(E/K)$ are finite, then
\begin{equation*}
\frac{\# \Sha(E/F). \# \Sha(E_D/F)}{\# \Sha(E/K)}=2^{r_{D,F}-r_F-\delta(E,F,K)}. \left(E(F):N(E(K))\right)^2,
\end{equation*}
where $\delta(E,F,K)=\delta_{\infty} + \delta_f$ with
\vspace*{0.15cm}
\begin{itemize}
\item
$\delta_{\infty}=\#\{v \in M_F^{\infty} : v \, \text{is ramified in} \, K \, \text{and} \, \sigma_{v}(\Delta(E)) >0\}$,
\vspace*{0.15cm}
\item
$\delta_f=\sum_{v \in S_0}\log_2\left(E(F_v):N_{K_w/F_v}^E(E(K_{w}))\right)$.
\end{itemize}
Here $\Delta(E)$ denotes the discriminant of $E$ over $F$, $\sigma_{v}$ denotes the real embedding of $F$ corresponding to $v \in M_F^{\infty}$, and $N_{K_w/F_v}^E$ denotes the local norm map.
\vspace*{0.25cm}
\item[(iv)]
Let
\begin{equation*}
S= \{v \in M_F^0 \, : \, v \, \text{is ramified in} \, K \, \text{or} \, E \, \text{has bad reduction at} \, v \},
\end{equation*}
and
\begin{equation*}
S_0=\{v \in S : v \, \text{is ramified on inertial in} \, K \}.
\end{equation*}
Then for every $v \in M_F$, one has
\begin{equation*}
H^1(G_w,E(K_w)) =
\left\{
\begin{array}{ll}
0 &: \, v \not \in S_0 \cup M_F^{\infty} \\
E(F_v)/N_{K_w/F_v}^E(E(K_w)) &: v \in S_0 \\
0 &: \, v \in M_F^{\infty} \, \text{unramified in} \, K \, \text{or} \, \sigma_{v}(\Delta_E)<0 \\
\mathbb{Z}/2\mathbb{Z} &: \, v \in M_F^{\infty} \, \text{ramified in} \, K \, \text{and} \, \sigma_{v}(\Delta_E)>0. \\
\end{array}
\right.
\end{equation*}
\end{itemize}
\end{proposition}
\begin{corollary} \label{corollary, if E(F)=N(E(K)) then Sha(ED/F) divides Sha(E/K)}
With the assumptions and notations of Proposition \ref{proposition, Qiu results}:
\begin{itemize}
\item[(i)]
One can rewrite \eqref{equation, EC-BRZ} as follows
{\footnotesize
\begin{equation} \label{equation, EC-BRZ in terms of S0 and infiinte places}
0 \rightarrow \Ker\left(\widetilde{res}_{K/F}^E\right) \rightarrow H^1\left(G,E(K)\right) \xrightarrow{\mathcal{F}} \bigoplus_{v \in S_0 \cup M_F^{\infty}} H^1\left(G_{w},E(K_w)\right) \rightarrow \frac{\Ker(\widetilde{trans}^E_{K/F})}{\widetilde{res}_{K/F}^E\left(\Sha(E/F)\right)} \rightarrow 0.
\end{equation}}
\item[(i)] If \eqref{equation, EC-BRZ} is exact, then
\begin{equation*}
\# \Ker(\trans^E_{K/F})=\frac{2^{r_F+\delta(E,F,K)-r_{D,F}}.\#\Sha(E/F) }{\left(E(F):N^E_{K/F}(E(K)) \right)}.
\end{equation*}
\item[(ii)]
If the norm map
\begin{align*}
N_{K/F}^E: E(K) & \rightarrow E(F) \\
P & \mapsto P+\sigma(P)
\end{align*}
is surjective, e.g. if $E(F)=0$, then
\begin{equation*}
\# \Ker(\trans^E_{K/F}) = \frac{\# \Sha(E/K)}{\# \Sha(E_D/F)}.
\end{equation*}
In particular, in this case $\# \Sha(E_D/F)$ is a divisor of $\# \Sha(E/K)$.
\end{itemize}
\end{corollary}
\begin{proof}
Part (i) immediately follows from Proposition \ref{proposition, Qiu results}.
Combining part (iii) of Proposition \ref{proposition, Qiu results} with Theorem \ref{theorem, order of ker(trans-tilde)}, one can prove part (ii). For proving part (iii), note that by Corollary \ref{corollary, if the norm map is surjective then the analogue of BRZ is exact}, surjectiveness of the norm map $N_{K/F}^E$ implies that \eqref{equation, EC-BRZ} is exact and using Theorem \ref{theorem, order of ker(trans-tilde)}, we obtain the desired equality.
\end{proof}
\iffalse
\begin{example}
Let $K=\mathbb{Q}(\sqrt{p})$ where $p \equiv 1 (\mathrm{mod}\, 8)$ is an odd prime number, and $E$ be the elliptic curve given by
\begin{equation*}
E_p/\mathbb{Q}: y^2=x^3-p^2x.
\end{equation*}
By \cite[Lemma 3.2]{Qiu} we have $\delta(E,\mathbb{Q},K)=2$. If the full Birch and Swinnerton-Dyer (BSD) conjecture is true for $E_p$ over $\mathbb{Q}$, then $\rank_{\mathbb{Z}}\left(E_p(\mathbb{Q})\right)=0$ and $\Sha(E_p/\mathbb{Q})$ is finite. Also $\Sha(E/\mathbb{Q})=0$, $\left(E_p(\mathbb{Q}):N_{K/\mathbb{Q}}^{E_p}(E_p(K))\right)=4$ and \begin{equation*}
E(K)_{tors}=E(\mathbb{Q})=E(\mathbb{Q})[2] \simeq \left(\mathbb{Z}/2\mathbb{Z}\right)^2,
\end{equation*}
see \cite[proof of Lemma 3.2]{Qiu}. Using Corollary \eqref{corollary, if E(F)=N(E(K)) then Sha(ED/F) divides Sha(E/K)} we obtain
\begin{equation*}
\# \Ker(\trans^{E_p}_{K/\mathbb{Q}})=\frac{4.\#\Sha(E/\mathbb{Q})}{\left(E(\mathbb{Q}):N_{K/\mathbb{Q}}^{E_p}(E_p(K))\right)}=1.
\end{equation*}
\end{example}
\subsection{Elliptic Curve $y^2=x^3-x$}
Using Qiu's results in \cite[$\S$3]{Qiu}, one may find some examples of elliptic curve $E$ over a finite Galois extension $K/F$ for which $\Ker(\widetilde{trans}^E_{K/F})$ can be efficiently computed:
\begin{theorem}
Let $E/\mathbb{Q}:y^2=x^3-x$, $K=\mathbb{Q}(\sqrt{n})$ where $n \neq 0,1$ is a squarefree integer and $G=Gal(K/\mathbb{Q})$. If $n \equiv 1 (\mathrm{mod}\, 8)$, then the following sequence is exact
{\footnotesize
\begin{equation} \label{equation, EBRZ exact sequence for E and Q(square root of n)}
0 \rightarrow H^1\left(G,E(K)\right) \xrightarrow{\mathcal{F}} \bigoplus_{\substack{v \in \{2, \mathbb{R}\} \\ \text{or} \, v |n }} H^1\left(G_{w},E(K_w)\right) \rightarrow \Ker(\widetilde{trans}^E_{K/\mathbb{Q}}) \rightarrow 0,
\end{equation}}
where $w \in M_K$ is a place of $K$ lying above $v$ and $G_w=Gal(K_w/\mathbb{Q}_v)$.
\end{theorem}
\begin{proof}
Since $\Sha(E/\mathbb{Q})=0$ \cite[$\S$3, page 5060]{Qiu}, $\widetilde{res}_{K/\mathbb{Q}}^E$ is the zero map. Hence the above sequence \eqref{equation, EBRZ exact sequence for E and Q(square root of n)} is exact if and only if the localization map
\begin{equation*}
\mathcal{F}_0^{\prime}:\widehat{H}^0(G,E(K)) \rightarrow \prod_{v \in M_{\mathbb{Q}}} \widehat{H}^0\left(G_w,E(K_w)\right)
\end{equation*}
is zero, see Remark \eqref{remark, image of the maps I and F_0 have the same order}. On the other hand, for every $v \in M_{\mathbb{Q}}$
\begin{equation*}
\widehat{H}^0\left(G_w,E(K_w)\right) =\frac{E(\mathbb{Q}_v)}{N(E(K_w))}.
\end{equation*}
\end{proof}
\fi
\end{document} | math |
کارتِک چھُ اَکھ رؠتھ. | kashmiri |
আন্দামাননিকোবর দ্বীপপুঞ্জ ভূমিকম্প, রিখটর স্কেলে কম্পনের মাত্রা ৪.৪ নিজস্ব সংবাদদাতাঃ ভূমিকম্পে কেঁপে উঠল দেশের আন্দামাননিকোবর দ্বীপপুঞ্জ ন্যাশনাল সেন্টার ফর সিসমোলজি এনসিএস জানাচ্ছে, সোমবার মধ্যরাতে আন্দামাননিকোবর দ্বীপপুঞ্জের ক্যাম্পবেল বে থেকে ৮৫ কিলোমিটার দূরে ভূমিকম্প হয় রিখটর স্কেলে কম্পনের মাত্রা ছিল ৪.৪ ক্ষয়ক্ষতির খবর পাওয়া যায়নি এদিন মধ্যরাত ১টা ১১ মিনিটে নাগাদ একটি ভূমিকম্প অনুভূত হয় আরও খবরঃ https:anmnews.inHomeGetNewsDetails?p97893 Share on Facebook Share on Whatsapp Share on Tweet | bengali |
/**
* Copyright 2016 LinkedIn Corp. All rights reserved.
*
* 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.
*/
package com.github.ambry.frontend;
import com.codahale.metrics.Counter;
import com.codahale.metrics.Histogram;
import com.codahale.metrics.Meter;
import com.codahale.metrics.MetricRegistry;
import com.github.ambry.rest.RestRequestMetrics;
/**
* Ambry frontend specific metrics tracking.
* <p/>
* Exports metrics that are triggered by the Ambry frontend to the provided {@link MetricRegistry}.
*/
class FrontendMetrics {
private static final String SSL_SUFFIX = "Ssl";
// RestRequestMetrics instances
// DELETE
public final RestRequestMetrics deleteBlobMetrics;
public final RestRequestMetrics deleteBlobSSLMetrics;
// HEAD
public final RestRequestMetrics headBlobMetrics;
public final RestRequestMetrics headBlobSSLMetrics;
// GET
public final RestRequestMetrics getBlobInfoMetrics;
public final RestRequestMetrics getBlobInfoSSLMetrics;
public final RestRequestMetrics getBlobMetrics;
public final RestRequestMetrics getBlobSSLMetrics;
public final RestRequestMetrics getUserMetadataMetrics;
public final RestRequestMetrics getUserMetadataSSLMetrics;
public final RestRequestMetrics getPeersMetrics;
public final RestRequestMetrics getPeersSSLMetrics;
public final RestRequestMetrics getReplicasMetrics;
public final RestRequestMetrics getReplicasSSLMetrics;
// POST
public final RestRequestMetrics postBlobMetrics;
public final RestRequestMetrics postBlobSSLMetrics;
// Rates
// AmbrySecurityService
public final Meter securityServiceProcessRequestRate;
public final Meter securityServicePostProcessRequestRate;
public final Meter securityServiceProcessResponseRate;
// AmbryIdConverter
public final Meter idConverterRequestRate;
// Latencies
// AmbryBlobStorageService
// DELETE
public final Histogram deletePreProcessingTimeInMs;
// HEAD
public final Histogram headPreProcessingTimeInMs;
// GET
public final Histogram getPreProcessingTimeInMs;
// POST
public final Histogram blobPropsBuildTimeInMs;
public final Histogram postPreProcessingTimeInMs;
// DeleteCallback
public final Histogram deleteCallbackProcessingTimeInMs;
public final Histogram deleteTimeInMs;
// HeadCallback
public final Histogram headCallbackProcessingTimeInMs;
public final Histogram headTimeInMs;
public final Histogram headSecurityResponseTimeInMs;
public final Histogram headSecurityResponseCallbackProcessingTimeInMs;
// GetCallback
public final Histogram getCallbackProcessingTimeInMs;
public final Histogram getTimeInMs;
public final Histogram getSecurityResponseCallbackProcessingTimeInMs;
public final Histogram getSecurityResponseTimeInMs;
// PostCallback
public final Histogram outboundIdConversionCallbackProcessingTimeInMs;
public final Histogram outboundIdConversionTimeInMs;
public final Histogram postCallbackProcessingTimeInMs;
public final Histogram postTimeInMs;
public final Histogram postSecurityResponseTimeInMs;
public final Histogram postSecurityResponseCallbackProcessingTimeInMs;
// InboundIdConverterCallback
public final Histogram inboundIdConversionCallbackProcessingTimeInMs;
public final Histogram inboundIdConversionTimeInMs;
// SecurityProcessRequestCallback
public final Histogram deleteSecurityRequestCallbackProcessingTimeInMs;
public final Histogram getSecurityRequestCallbackProcessingTimeInMs;
public final Histogram getPeersSecurityRequestCallbackProcessingTimeInMs;
public final Histogram headSecurityRequestCallbackProcessingTimeInMs;
public final Histogram postSecurityRequestCallbackProcessingTimeInMs;
public final Histogram deleteSecurityRequestTimeInMs;
public final Histogram getSecurityRequestTimeInMs;
public final Histogram headSecurityRequestTimeInMs;
public final Histogram postSecurityRequestTimeInMs;
public final Histogram getPeersSecurityRequestTimeInMs;
// SecurityPostProcessRequestCallback
public final Histogram getPeersSecurityPostProcessRequestTimeInMs;
// AmbrySecurityService
public final Histogram securityServiceProcessRequestTimeInMs;
public final Histogram securityServicePostProcessRequestTimeInMs;
public final Histogram securityServiceProcessResponseTimeInMs;
// AmbryIdConverter
public final Histogram idConverterProcessingTimeInMs;
// GetPeersHandler
public final Histogram getPeersProcessingTimeInMs;
// GetReplicasHandler
public final Histogram getReplicasProcessingTimeInMs;
// Errors
// AmbryBlobStorageService
public final Counter responseSubmissionError;
public final Counter resourceReleaseError;
public final Counter routerCallbackError;
public final Counter ttlTooLargeError;
// DeleteCallback
public final Counter deleteCallbackProcessingError;
// HeadCallback
public final Counter headCallbackProcessingError;
// GetCallback
public final Counter getCallbackProcessingError;
public final Counter getSecurityResponseCallbackProcessingError;
// PostCallback
public final Counter postCallbackProcessingError;
public final Counter outboundIdConversionCallbackProcessingError;
// GetPeersHandler
public final Counter unknownDatanodeError;
// GetReplicasHandler
public final Counter invalidBlobIdError;
public final Counter responseConstructionError;
// Other
// AmbryBlobStorageService
public final Histogram blobStorageServiceStartupTimeInMs;
public final Histogram blobStorageServiceShutdownTimeInMs;
// Account
public final Counter unrecognizedServiceIdCount;
public final Counter unrecognizedAccountNameCount;
public final Counter unrecognizedContainerNameCount;
public final Counter getHeadDeleteUnrecognizedAccountCount;
public final Counter getHeadDeleteUnrecognizedContainerCount;
public final Meter putWithServiceIdForAccountNameRate;
public final Meter putWithAccountAndContainerHeaderRate;
/**
* Creates an instance of FrontendMetrics using the given {@code metricRegistry}.
* @param metricRegistry the {@link MetricRegistry} to use for the metrics.
*/
public FrontendMetrics(MetricRegistry metricRegistry) {
// RestRequestMetrics instances
// DELETE
deleteBlobMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "DeleteBlob", metricRegistry);
deleteBlobSSLMetrics =
new RestRequestMetrics(AmbryBlobStorageService.class, "DeleteBlob" + SSL_SUFFIX, metricRegistry);
// HEAD
headBlobMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "HeadBlob", metricRegistry);
headBlobSSLMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "HeadBlob" + SSL_SUFFIX, metricRegistry);
// GET
getBlobInfoMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "GetBlobInfo", metricRegistry);
getBlobInfoSSLMetrics =
new RestRequestMetrics(AmbryBlobStorageService.class, "GetBlobInfo" + SSL_SUFFIX, metricRegistry);
getBlobMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "GetBlob", metricRegistry);
getBlobSSLMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "GetBlob" + SSL_SUFFIX, metricRegistry);
getUserMetadataMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "GetUserMetadata", metricRegistry);
getUserMetadataSSLMetrics =
new RestRequestMetrics(AmbryBlobStorageService.class, "GetUserMetadata" + SSL_SUFFIX, metricRegistry);
getPeersMetrics = new RestRequestMetrics(GetPeersHandler.class, "GetPeers", metricRegistry);
getPeersSSLMetrics = new RestRequestMetrics(GetPeersHandler.class, "GetPeers" + SSL_SUFFIX, metricRegistry);
getReplicasMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "GetReplicas", metricRegistry);
getReplicasSSLMetrics =
new RestRequestMetrics(AmbryBlobStorageService.class, "GetReplicas" + SSL_SUFFIX, metricRegistry);
// POST
postBlobMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "PostBlob", metricRegistry);
postBlobSSLMetrics = new RestRequestMetrics(AmbryBlobStorageService.class, "PostBlob" + SSL_SUFFIX, metricRegistry);
// Rates
// AmbrySecurityService
securityServiceProcessRequestRate =
metricRegistry.meter(MetricRegistry.name(AmbrySecurityService.class, "ProcessRequestRate"));
securityServicePostProcessRequestRate =
metricRegistry.meter(MetricRegistry.name(AmbrySecurityService.class, "PostProcessRequestRate"));
securityServiceProcessResponseRate =
metricRegistry.meter(MetricRegistry.name(AmbrySecurityService.class, "ProcessResponseRate"));
// AmbryIdConverter
idConverterRequestRate = metricRegistry.meter(MetricRegistry.name(AmbryIdConverterFactory.class, "RequestRate"));
// Latencies
// AmbryBlobStorageService
// DELETE
deletePreProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "DeletePreProcessingTimeInMs"));
// HEAD
headPreProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "HeadPreProcessingTimeInMs"));
// GET
getPreProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "GetPreProcessingTimeInMs"));
// POST
blobPropsBuildTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "BlobPropsBuildTimeInMs"));
postPreProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "PostPreProcessingTimeInMs"));
// DeleteCallback
deleteCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "DeleteCallbackProcessingTimeInMs"));
deleteTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "DeleteCallbackResultTimeInMs"));
// HeadCallback
headCallbackProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "HeadCallbackProcessingTimeInMs"));
headTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "HeadCallbackResultTimeInMs"));
headSecurityResponseCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "HeadSecurityResponseCallbackProcessingTimeInMs"));
headSecurityResponseTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "HeadSecurityResponseTimeInMs"));
// GetCallback
getCallbackProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "GetCallbackProcessingTimeInMs"));
getTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "GetCallbackResultTimeInMs"));
getSecurityResponseCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "GetSecurityResponseCallbackProcessingTimeInMs"));
getSecurityResponseTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "GetSecurityResponseTimeInMs"));
// PostCallback
outboundIdConversionCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "OutboundIdCallbackProcessingTimeInMs"));
outboundIdConversionTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "OutboundIdConversionTimeInMs"));
postCallbackProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "PostCallbackProcessingTimeInMs"));
postTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "PostCallbackResultTimeInMs"));
postSecurityResponseTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "PostSecurityResponseTimeInMs"));
postSecurityResponseCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "PostSecurityResponseCallbackProcessingTimeInMs"));
// InboundIdConverterCallback
inboundIdConversionCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "InboundIdCallbackProcessingTimeInMs"));
inboundIdConversionTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "InboundIdConversionTimeInMs"));
// SecurityProcessRequestCallback
deleteSecurityRequestCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "DeleteSecurityRequestCallbackProcessingTimeInMs"));
deleteSecurityRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "DeleteSecurityRequestTimeInMs"));
headSecurityRequestCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "HeadSecurityRequestCallbackProcessingTimeInMs"));
headSecurityRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "HeadSecurityRequestTimeInMs"));
getSecurityRequestCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "GetSecurityRequestCallbackProcessingTimeInMs"));
getPeersSecurityRequestCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "GetPeersSecurityRequestCallbackProcessingTimeInMs"));
getSecurityRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "GetSecurityRequestTimeInMs"));
postSecurityRequestCallbackProcessingTimeInMs = metricRegistry.histogram(
MetricRegistry.name(AmbryBlobStorageService.class, "PostSecurityRequestCallbackProcessingTimeInMs"));
postSecurityRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "PostSecurityRequestTimeInMs"));
getPeersSecurityRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(GetPeersHandler.class, "SecurityRequestTimeInMs"));
// SecurityPostProcessRequestCallback
getPeersSecurityPostProcessRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(GetPeersHandler.class, "SecurityPostProcessRequestTimeInMs"));
// AmbrySecurityService
securityServiceProcessRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbrySecurityService.class, "RequestProcessingTimeInMs"));
securityServicePostProcessRequestTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbrySecurityService.class, "RequestPostProcessingTimeInMs"));
securityServiceProcessResponseTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbrySecurityService.class, "ResponseProcessingTimeInMs"));
// AmbryIdConverter
idConverterProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryIdConverterFactory.class, "ProcessingTimeInMs"));
// GetPeersHandler
getPeersProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(GetPeersHandler.class, "ProcessingTimeInMs"));
// GetReplicasHandler
getReplicasProcessingTimeInMs =
metricRegistry.histogram(MetricRegistry.name(GetReplicasHandler.class, "ProcessingTimeInMs"));
// Errors
// AmbryBlobStorageService
responseSubmissionError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "ResponseSubmissionError"));
resourceReleaseError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "ResourceReleaseError"));
routerCallbackError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "RouterCallbackError"));
// DeleteCallback
deleteCallbackProcessingError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "DeleteCallbackProcessingError"));
// HeadCallback
headCallbackProcessingError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "HeadCallbackProcessingError"));
// GetCallback
getCallbackProcessingError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "GetCallbackProcessingError"));
getSecurityResponseCallbackProcessingError = metricRegistry.counter(
MetricRegistry.name(AmbryBlobStorageService.class, "GetSecurityResponseCallbackProcessingError"));
// PostCallback
postCallbackProcessingError =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "PostCallbackProcessingError"));
outboundIdConversionCallbackProcessingError = metricRegistry.counter(
MetricRegistry.name(AmbryBlobStorageService.class, "OutboundIdConversionCallbackProcessingError"));
ttlTooLargeError = metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "TtlTooLargeError"));
// GetPeersHandler
unknownDatanodeError = metricRegistry.counter(MetricRegistry.name(GetPeersHandler.class, "UnknownDatanodeError"));
// GetReplicasHandler
invalidBlobIdError = metricRegistry.counter(MetricRegistry.name(GetReplicasHandler.class, "InvalidBlobIdError"));
responseConstructionError =
metricRegistry.counter(MetricRegistry.name(GetReplicasHandler.class, "ResponseConstructionError"));
// Other
blobStorageServiceStartupTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "StartupTimeInMs"));
blobStorageServiceShutdownTimeInMs =
metricRegistry.histogram(MetricRegistry.name(AmbryBlobStorageService.class, "ShutdownTimeInMs"));
// Account and container
unrecognizedServiceIdCount =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "UnrecognizedServiceIdCount"));
unrecognizedAccountNameCount =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "UnrecognizedAccountNameCount"));
unrecognizedContainerNameCount =
metricRegistry.counter(MetricRegistry.name(AmbryBlobStorageService.class, "UnrecognizedContainerNameCount"));
getHeadDeleteUnrecognizedAccountCount = metricRegistry.counter(
MetricRegistry.name(AmbryBlobStorageService.class, "GetHeadDeleteUnrecognizedAccountCount"));
getHeadDeleteUnrecognizedContainerCount = metricRegistry.counter(
MetricRegistry.name(AmbryBlobStorageService.class, "GetHeadDeleteUnrecognizedContainerCount"));
putWithServiceIdForAccountNameRate =
metricRegistry.meter(MetricRegistry.name(AmbryBlobStorageService.class, "PutWithServiceIdForAccountNameRate"));
putWithAccountAndContainerHeaderRate = metricRegistry.meter(
MetricRegistry.name(AmbryBlobStorageService.class, "PutWithAccountAndContainerHeaderRate"));
}
}
| code |
दस सरकारी विभागों के पास नहीं अपनी छत, किराये के कमरे में चल रहे प्रदेश के गठन के पांच दशक बाद भी जिले के 10 सरकारी कार्यालय शहर के गली, कूचों में किराये के भवनों में चल रहे हैं। ऐसे में इन कार्यालयों में काम से आने वाले लोगों को कार्यालय तलाश करने में परेशानी होती है। आंगनबाड़ी कार्यालय मोहल्ला न्यू जमालपुर कॉलोनी में किराये के भवन में चल रहा है। इस कार्यालय में रोजाना सैकड़ों की संख्या में आंगनबाड़ी कार्यकर्ता और सहायिका आती हैं। पुरानी कचहरी के पास जिला प्रबंधक अनुसूचित जाति व जनजाति कार्यालय के साथ में जिला विजिलेंस कार्यालय भी किराये के भवन में चल रहा है। जिसके चलते इन कार्यालयों में आने वाले लोगों को परेशानी होती है। प्रदेश सरकार ने घोषणा कि थी कि लोगों को एक छत के नीचे सभी सरकारी कार्यालय मिलेंगे पर ऐसा नहीं है। अगर बात जिला सचिवालय कि करें तो करीब दस सरकारी कार्यालय जिला सचिवालय से दूर किराये के भवनों में चल रहे हैं। अगर किसी को सचिवालय में काम खत्म करने के बाद शिक्षा विभाग या विजिलेंस कार्यालय जाना हो तो उन्हें दो किलोमीटर दूर जाना पड़ता है। लेकिन स्थानीय प्रशासन या सरकार उनकी दिक्कतों पर ध्यान नहीं दे रही है। शिक्षा विभाग का कार्यालय हुडा सेक्टर में बने स्कूल के भवन में चल रहा है। मिनी सचिवालय से दो से तीन किलोमीटर दूर हैं कार्यालय जिला सचिवालय से दूर करीब दस सरकारी कार्यालय हैं, जिनमें आंगनबाड़ी, अनुसूचित जनजाति, माइनिंग, विजिलेंस, होमगार्ड, शिक्षा, सेंट्रल आईबी व महिला बाल विकास निगम हैं। इनके कार्यालय मिनी सचिवालय से करीब दो से तीन किलोमीटर दूर होने से लोगों को परेशानी का सामना करना पड़ रहा है। मिनी सचिवालय में सभी सरकारी कार्यालयों को एक छत के नीचे लाने के लिए तत्कालीन उपायुक्त अजय कुमार के साथ बैठक की थी। लेकिन मिनी सचिवालय में सभी कार्यालय एक जगह करने में पर्याप्त कमरे नहीं हैं। मनोज कुमार, एसडीएम, नारनौल। | hindi |
ಕಂಗನಾ ವಿರುದ್ದ FIR ದಾಖಲಿಸುವಂತೆ ನಿರ್ದೇಶನ ನೀಡಿದ ತುಮಕೂರು ನ್ಯಾಯಾಲಯ ಕೃಷಿ ಮಸೂದೆಗಳನ್ನು ವಿರೋಧಿಸಿ ಬೀದಿಗಿಳಿದು ಪ್ರತಿಭಟಿಸಿದ್ದ ರೈತರನ್ನು ಭಯೋತ್ಪಾದಕರಿಗೆ ಹೋಲಿಸಿದ್ದ ಕಂಗನಾ ರಾಣಾವತ್ ವಿರುದ್ದ ಎಫ್ಐಆರ್ ದಾಖಲಿಸುವಂತೆ ತುಮಕೂರು ಜೆಎಂಎಫ್ಸಿ ನ್ಯಾಯಾಲಯ ಆದೇಶ ನೀಡಿದೆ.ನ್ಯಾಯಮೂರ್ತಿ ವಿನೋದ್ ಬಾಲನಾಯಕ್ ಅವರು ಕ್ಯಾತ್ಸಂದ್ರ ಪೊಲೀಸರಿಗೆ ಎಫ್ಐಆರ್ ದಾಖಲಿಸುವಂತೆ ಹೇಳಿದ್ದಾರೆ. ಕಂಗಣಾ ವಿರುದ್ದ ಮಕೂರು ತಾಲ್ಲೂಕು ಕದರನಹಳ್ಳಿ ತಾಂಡಾ ವಾಸಿ ಹಾಗೂ ಹೈಕೋರ್ಟ್ ವಕೀಲ ಎಲ್ ರಮೇಶ್ ನಾಯಕ್ ಅವರು ಡಿಜಿಪಿ ಮತ್ತು ಜಿಲ್ಲಾ ಪೊಲೀಸ್ ವರಿಷ್ಠಾಧಿಕಾರಿಗೆ ದೂರು ಸಲ್ಲಿಸಿದ್ದರು.ಪ್ರತಿಧ್ವನಿಯನ್ನು ಬೆಂಬಲಿಸಲು ಇಲ್ಲಿ ಕ್ಲಿಕ್ ಮಾಡಿ ನ್ಯಾಯಾಲಯವು ಐಪಿಸಿ ಸೆಕ್ಷನ್ 153A, 504 ಮತ್ತು 108ರ ಅಡಿಯಲ್ಲಿ ಎಫ್ಐಆರ್ ದಾಖಲಿಸಲು ಸೂಚನೆ ನೀಡಿದೆ.ಪೊಲೀಸರು ಯಾವುದೇ ಕ್ರಮ ಕೈಗೊಳ್ಳದ ಕಾರಣ ನೇರವಾದ ನ್ಯಾಯಾಲಯದ ಕದ ತಟ್ಟಿದ ರಮೇಶ್ ಅವರು, ಎಫ್ಐಆರ್ ದಾಖಲಿಸುವಂತೆ ಪೊಲೀಸರಿಗೆ ನಿರ್ದೇಶನ ನೀಡಲು ಮನವ ಸಲ್ಲಿಸಿದ್ದರು. ಇಲ್ಲವಾದಲ್ಲಿ ನ್ಯಾಯಾಲಯವೇ ಕ್ರಮ ಕೈಗೊಳ್ಳಬೇಕೆಂದು ಕೇಳಿಕೊಂಡಿದ್ದರು. | kannad |
വടക്കാഞ്ചേരി സബ് കോടതിയുടെ നിര്മാണം മുന്ഗണനാ പട്ടികയില് മൂന്നാമത്: മുഖ്യമന്ത്രി വടക്കാഞ്ചേരി: വടക്കാഞ്ചേരിയില് പുതിയ സബ് കോടതി അനുവദിക്കുന്ന കാര്യം പരിശോധിക്കാമെന്നും ഇതിനായുള്ള മുന്ഗണനാ പട്ടികയില് വടക്കാഞ്ചേരി മൂന്നാം സ്ഥാനത്താണെന്നും മുഖ്യമന്ത്രി പിണറായി വിജയന് നിയമസഭയില് പറഞ്ഞു. ഒന്നര നൂറ്റാണ്ട് പഴക്കമുള്ളതും ബൃഹത്തായ അധികാര പരിധിയുള്ളതുമായ വടക്കാഞ്ചേരി മുന്സിഫ് മജിസ്ട്രേറ്റ് കോടതിയില് ഒരു സബ് കോടതി, പോക്സോ കോടതി, എംഎസിടി കോടതി, കുടുംബ കോടതി എന്നിവ അനുവദിക്കണമെന്ന സേവ്യര് ചിറ്റിലപ്പിള്ളി എംഎല്എയുടെ സബ്മിഷനു മറുപടി പറയുകയായിരുന്നു മുഖ്യമന്ത്രി. തലപ്പിള്ളി താലൂക്ക് ആസ്ഥാനമായ വടക്കാഞ്ചേരിയില് 1863ല് സ്ഥാപിതമായതും 150 ലധികം വര്ഷം പഴക്കമുള്ളതുമായ കോടതിയാണു പ്രവര്ത്തിക്കുന്നത്. കുന്നംകുളം, തൃശൂര്, തലപ്പിള്ളി താലൂക്കുകളിലായി 73 വില്ലേജുകള് ഉള്പ്പെടുന്നതും ആറു പോലീസ് സ്റ്റേഷനുകളും നാല് എക്സൈസ് റേഞ്ച് ഓഫീസുകളും മച്ചാട് വടക്കാഞ്ചേരി ഫോറസ്റ്റ് സ്റ്റേഷനുകളും ഉള്പ്പെടെ കേരളത്തിലെത്തന്നെ ഏറ്റവും വലിയ അധികാര പരിധിയിലുള്ള മുന്സിഫ് മജിസ്ട്രേറ്റ് കോടതിയാണു വടക്കാഞ്ചേരിയിലേത്. എന്നാല്, നാളിതുവരെ ഈ കോടതിയോടനു ബന്ധിച്ച് അഡീഷണല് കോടതികള് അനുവദിക്കുകയോ, മറ്റു എടുത്തു പറയത്തക്ക വികസന പ്രവര്ത്തനങ്ങള് നടപ്പാക്കുകയോ ഉണ്ടായിട്ടില്ല. പുതിയ കോടതികള് ആരംഭിക്കുന്നതിനു സര്ക്കാര് നിലവില് തീരുമാനമെടുത്തിട്ടില്ല. നിലവിലെ സാഹചര്യങ്ങള് കണക്കിലെടുത്ത് സ്ത്രീകള്ക്കും കുട്ടികള്ക്കുമെതിരായ കുറ്റകൃത്യങ്ങള് സംബന്ധിച്ച കേസുകള് വിചാരണ ചെയ്യുന്നതിനുള്ള പ്രത്യേക കോടതികള് ആരംഭിക്കുന്നതിനാണു സര്ക്കാര് പ്രാധാന്യം നല്കുന്നത്. അവ നിലവില് വരുന്ന മുറയ്ക്ക് പുതിയ കോടതികള് ആരംഭിക്കുന്ന കാര്യം പരിശോധിക്കാമെന്നും മുഖ്യമന്ത്രി മറുപടിയില് കൂട്ടിച്ചേര്ത്തു. | malyali |
How to properly configure AD FS Proxy to access private AD FS from Internet?
I need to access my AD FS 3.0 federation metadata (internal network, domain.local) from (e.g.) my PC over Internet by simply resolving IP of ADFS Proxy or using some public domain which is NOT the same as AD FS domain. With self-signed cert (I will ignore/skip the warning in browser). How should I set up the ADFS Proxy (WAP) then? | english |
Nestled against foothills of ponderosa pine, Hart Ranch's 18-hole Championship Golf Course is a treat for any golfer. We are proud to have quietly become one of the Upper Midwest's premier golf facilities. We have been listed in Golf Digest's "Places to Play" not only because of the challenging golf, but also the friendly service and smiling faces. This is a great place for us to come to work everyday. You'll find it's a great place to come to play everyday as well.
Their award-winning course design provides both the novice and the scratch handicapper a memorable golfing experience. Unique to the area is our PGA Family Course Program. This program uses Family Tee plates to establish a beginner-friendly short course within the existing golf facility.
Perfect for golfers of all ages and all ability levels, the course is open to the public.
Since becoming an 18-hole course in 1995, Hart Ranch has been selected to host numerous South Dakota State Championship events.
Hart Ranch Golf Course is what Black Hills Golf is all about. Quiet, secluded, a great 18-hole Golf challenge located just 8 miles south of Rapid City, SD. | english |
लंबी कूद : प्रदेश की टीम में जिले के प्रदीप का हुआ चयन सिद्धार्थनगर। निज संवाददाताएथलेटिक्स फेडरेशन ऑफ इंडिया की ओर से प्रथम इंडियन ओपन जंप कंपटीशन 2022 का आयोजन एक मार्च को त्रिवेंद्रम केरल में होगा। इसमें उत्तर प्रदेश से प्रतिभाग करने वाली टीम में लोटन ब्लॉक के सैनुआ गांव निवासी प्रदीप चौरसिया का भी चयन हुआ है। इनके चयन पर लोगों ने बधाई दी है।सैनुआ गांव निवासी मधुर श्याम चौरसिया के पुत्र प्रदीप चौरसिया का चयन उत्तर प्रदेश की टीम में लंबी कूद प्रतियोगिता के लिए किया गया है। प्रदीप ने उत्तर प्रदेश की टीम में चयन के लिए अपना बेहतर प्रदर्शन किया। उसने 6.93 मीटर लंबीकूद कर चयन होने में सफलता हासिल की है। वर्तमान में प्रदीप सैफई स्टेडियम में प्रशिक्षण प्राप्त कर रहा है। प्रदीप के राष्ट्रीय प्रतियोगिता के लिए उत्तर प्रदेश की टीम में चयन होने पर जिला एथलेटिक्स संघ के अध्यक्ष डॉ. चंद्रेश कुमार उपाध्याय, सचिव सोनू गुप्त, मो. इब्राहिम बाबा, देवेंद्र पांडेय, अब्दुल मन्नान, विनोद त्रिपाठी, रविंद्र गुर्जर, बृजपाल सिंह, उपेंद्र नाथ उपाध्याय ने बधाई दी है। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
package classes;
public class FunctionalLinkedListTest
{
public static void main(String[] args)
{
FunctionalLinkedList list = new FunctionalLinkedList();
list.add("One");
list.add("Two");
list.add("Three");
list.add("Four");
list.add("Five");
System.out.println(list.toString());
System.out.println("Size (should be 5): " + list.size());
list.add(3, "Added at position 3. Between 3 and 4");
System.out.println(list.toString());
System.out.println("Size (should be 6): " + list.size());
list.remove(5);
System.out.println(list.toString());
System.out.println("Size (should be 5): " + list.size());
System.out.println("Let's print out the 2: " + list.get(1).getReturnValue());
System.out.println("Let's print out the head (should be \"One\"): " + list.head().getReturnValue());
System.out.println("Let's print all elements except the head: " + list.rest().toString());
int initialSize = list.size();
for (int i = 0; i < initialSize; i++)
{
list.remove(0);
}
System.out
.println("It should be empty. Is it empty? " + list.isEmpty());
}
}
| code |
முதலமைச்சர் மு.க.ஸ்டாலின் சொன்னதை செய்வார்: அமைச்சர் சேகர்பாபு மழை நீர் தேங்காமல் இருக்க அரசு நடவடிக்கை எடுக்கும் என்றும் முதலமைச்சர் மு.க.ஸ்டாலின் சொன்னதை செய்வார் என்று அமைச்சர் சேகர் பாபு தெரிவித்தார். கடந்த சில நாட்களாக பெய்த தொடர் மழை காரணமாக, சென்னையில் பல்வேறு இடங்களில் தேங்கியுள்ள மழைநீர் இன்னும் வடியாமல் இருக்கிறது. இதன் காரணமாக பல்வேறு சுகாதார சீர்கேடுகள் ஏற்படுவதாக பொதுமக்கள் தெரிவித்து வருகின்றனர். இந்நிலையில் தண்ணீர் தேங்கியதற்கு காரணம் என்ன, தேங்காமல் இருக்க என்ன தீர்வு? என நியூஸ் 7 தமிழ், இன்று தொடர் நேரலையை வெள்ளம் பாதித்த பகுதிகளிலிருந்து அரசு கவனத்திற்கு கொண்டு செல்கிறது. இந்நிலையில் நியூஸ் 7 தமிழ் நடத்திய கள ஆய்வு எதிரொலியாக அமைச்சர் சேகர்பாபு சென்னை கொளத்தூர் பகுதியில் ஆய்வு மேற்கொண்டார். மழை நீர் தேங்காமல் இருப்பதற்கான நிரந்தர தீர்வு குறித்து, அவர் நியூஸ் 7 தமிழுக்கு அளித்த பேட்டியில் கூறியதாவது: மழை பெய்த நாளில் இருந்து முதலமைச்சர் கள ஆய்வில் இருக்கிறார். வெள்ளப் பாதிப்புகளை ஆய்வு செய்ய டெக்னிக்கல் கமிட்டியை அமைத்துள்ளார். ஓய்வு பெற்ற அதிகாரி திருப்பதி தலைமையில், மழை நீர் பாதிப்பில் இருந்து சென்னையை மீட்க, முழுமையான வரைவு திட்டத்தை தயார்படுத்த உத்தரவிட்டுள்ளார். கூடிய விரைவில் அந்த திட்டம் தயாரானவுடன், நிதியை பற்றி கவலைப்படாமல், கடந்த ஆட்சியில் வைத்திருக்கிற நிதி சுமையையும் எதிர்கொண்டு, கடந்த ஆட்சியின்போது கொள்ளையடிப்பதற்காக போட்ட திட்டங்களை உதறிவிட்டு, அவர்களுக்கு பாடம் புகட்டும் வகையில், அந்த திட்டம் செயல்படுத்தப்படும். முதலமைச்சர் மு.க.ஸ்டாலின் சொன்னதை செய்வார். நீர்நிலைகள் ஆக்கிரமிக்கப்பட்டுள்ளது. இனி ஆக்கிரமிப்பு செய்யப்படாமல் இருக்க அரசு கவனமுடன் இருக்கும். கடந்த அதிமுக ஆட்சி 10 ஆண்டுகள் ஆட்சி செய்தும் சென்னை மக்களுக்கு ஒரு விடியல் தரவில்லை. இவ்வாறு சேகர்பாபு தெரிவித்தார். Advertisement: SHARE | tamil |
मंत्रियों के वेतनभत्ते के लिए 1045 करोड़, जानें PMO को कितना मिला फंड लखनऊ. वित्त मंत्री निर्मला सीतारमण ने मंगलवार को आम बजट 2022 पेश किया. इसमें यूनियन कैबिनेट के लिए भी विशेष प्रावधान किया गया है. इस बार के बजट में केंद्रीय मंत्रियों के वेतनभत्ते, प्रधानमंत्री कार्यालय PMO, विदेशी मेहमानों के मनोरंजन आदि के लिए 1,711 करोड़ रुपये का प्रावधान किया गया है. इसके अलावा राष्ट्रीय सुरक्षा सचिवालय, प्रधान वैज्ञानिक सलाहकार, पूर्व राज्यपाल, पूर्व प्रधानमंत्रियों आदि के लिए भी बजट में फंड आवंटित किया गया है. बता दें कि इस बार के बजट में एक ओर जहां कई मदों में कटौती की गई है तो कई सेक्टर में फंड का आवंटन बढ़ाया भी गया है.1,711 करोड़ रुपये के फंड में 1,045 करोड़ रुपये सिर्फ मंत्रिपरिषद के लिए आवंटित किए गए हैं. यह फंड कैबिनेट मंत्रियों, राज्य मंत्रियों और पूर्व प्रधानमंत्रियों के वेतन, यात्रा व्यय और अन्य भत्तों पर आने वाले खर्च के लिए हैं. इसके तहत ही वीवीआईपी के लिए विशेष अतिरिक्त फ्लाइट का खर्च भी शामिल है. प्रधान वैज्ञानिक सलाहकार कार्यालय और नेशनल रिसर्च फाउंडेशन के लिए 300 करोड़ की व्यवस्था की गई है. इसके अलावा राष्ट्रीय सुरक्षा परिषद सचिवालय के लिए 232.71 करोड़ रुपये का प्रावधान किया गया है. कैबिनेट सेक्रेटेरियट के प्रशासनिक खर्च के लिए 66.70 करोड़ का प्रबंध किया गया है. | hindi |
چولا تعمٟرٲتی عٔلِمُک مرکَز آسہٕ کہِ وجہہ سٟتؠ چھُ یہِ علاقہٕ ثَقافتی وَراثَتہِ سٟتؠ مالا مال | kashmiri |
گوُ سہُ تمنَ آسئ کینہہِ فأنانشَٰ پراَبلمِ یاَ انِٹرشٹ یاَ بیہِ کُنہِ منٛز آسکھ پراَبلم یہِ چھِہ یِونَ | kashmiri |
Eid in Bagtui : খুশির নয়, স্বজনহারার শোকে বিষাদের ঈদ বগটুইতে ঈদের নমাজ পাঠ হচ্ছে সারা দেশে ঈদের প্রার্থনায় অংশ নিয়েছেন দেশের ইসলাম ধর্মালম্বী মানুষ পবিত্র ঈদ পালন করলেন স্বজনহারাদের শোকে বিহ্বল বগটুইয়ের বাসিন্দারাও Residents of Bagtui celebrate Eid রামপুরহাট, 3 মে : দেশজুড়ে পালিত হচ্ছে খুশির ঈদউলফিতর একমাস কঠিন রোজা পালনের পর চাঁদ দেখা গিয়েছে দেশের মুসলিম সম্প্রদায়ের মানুষ আজ পরিবারের সঙ্গে উত্সবের আনন্দে মেতে রয়েছে কিন্তু কেমন আছে রামপুরহাটের বগটুই গ্রাম ? 21 মার্চ বড়শাল গ্রাম পঞ্চায়েতের উপপ্রধান ভাদু শেখ হত্যার পর আগুন লাগিয়ে দেওয়া হয় বগটুইয়ের 12টি বাড়িতে এখনও পর্যন্ত সেই হিংসায় মৃতের সংখ্যা এসে দাঁড়িয়েছে 10এ Residents of Bagtui celebrate Eid একমাস পরেও স্বজনহারাদের শোকে বিহ্বল বগটুই গতবার পরিবারের সঙ্গে যাঁরা খুশিতে মেতে উঠেছিলেন, একরাতের দুঃস্বপ্নে তাঁদেরকেই পরিবারপরিজন হারাতে হয়েছে ফলে খুশির ঈদে যখন গোটা দেশ আনন্দে মাতোয়ারা, তখন আল্লাহকে ভারাক্রান্ত হৃদয়ে দোষীদের শাস্তির আর্জি জানাচ্ছেন মিহিলাল, শেখলালরা এদিন বৃষ্টি মাথায় নিয়েই গ্রামের জামা মসজিদে পুলিশ প্রহরায় নমাজ পড়তে যান বগটুইয়ের পরিবারের লোকজনরা নমাজের পর প্রশাসনের তরফ থেকে মিষ্টি বিতরণ করা হয় এদিন নমাজের পর শেখলাল বলেন, আমাদের পরিবারের যারা চলে গেছে তাঁদের আল্লাহ স্বর্গবাস দেন আজকের এই পবিত্র দিনে আর কিইবা চাইব খুশির নয়, স্বজনহারার শোকে বিষাদের ঈদ বগটুইতেখুশির ঈদে সন্তানদের সুস্বাস্থ্য, সুন্দর ভবিষ্যত্ প্রার্থনা করেন মুসলিম ধর্মপ্রাণ মানুষরা কিন্তু, 21 মার্চেই ওই হিংসায় বলি হয়েছে শিশুও নিজের সন্তানের কবরেই মাটি দিতে হয়েছে মিহিলাল শেখকে বগটুই গণহত্যা না হলে এদিনও হয়তো সন্তানের সুন্দর ভবিষ্যত্ই প্রার্থনা করতেন তিনি মার্চের ওই ভয়াবহ রাতে মা, মেয়ে, স্ত্রী এবং বোনকে হারিয়েছেন মিহিলাল শেখ মিহিলাল বলেন, আমাদের পরিবার চোখের সামনে আগুনে পুড়ে শেষ হয়ে গিয়েছে এই ঘটনাটা আমাদের কুঁড়ে কুঁড়ে খাচ্ছে কীভাবে খুশির ঈদ পালন করব ? দুঃখে, বেদনায় ভরা ঈদ পালন করলাম আরও পড়ুন : খোলা আকাশের নিচে বৃষ্টিস্নাত অসংখ্য মানুষ মগ্ন ঈদের প্রার্থনায়প্রসঙ্গত, গত 21 মার্চ খুন হন বড়শাল গ্রাম পঞ্চায়েতের উপপ্রধান ভাদু শেখ তারপরই আগুন লাগিয়ে দেওয়া হয় বগটুইয়ের 12টি বাড়িতে মহিলা ও শিশুসহ 7 জনকে কুপিয়ে খুন করে পেট্রল ঢেলে আগুনে পুড়িয়ে দেওয়া হয় পরে রামপুরহাট মেডিক্যাল কলেজ হাসপাতালে আরও 3জন অগ্নিদগ্ধ মহিলার মৃত্যু হয় হাইকোর্টের নির্দেশে ঘটনার তদন্তভার নিয়েছে সিবিআই ঘটনায় এখনও পর্যন্ত গ্রেফতার হয়েছে তৃণমূল নেতা আনারুল হোসেনসহ 28 জন | bengali |
تہٕ شہزادٕ بَنہِ تٔمۍ سُنٛد چیلہٕ تہٕ خٲدِم | kashmiri |
அனைத்து ரயில்களிலும் இதை உடனே அமல்படுத்த வேண்டும்.. ரயில் கட்டணம் குறித்து இந்திய ரயில்வே சொன்ன குட்நியூஸ்.. அனைத்து ரயில்களிலும் கொரோனா தொற்றுநோய்க்கு முந்தைய டிக்கெட் விலையை உடனடியாக அமல்படுத்துமாறு இந்திய ரயில்வே உத்தரவு பிறப்பித்துள்ளது..கோவிட் பற்றிய அனைத்து லேட்டஸ்ட் அப்டேட்களை இங்கே படியுங்கள் கொரோனா வைரஸ் காரணமாக ஊரடங்கு தளர்த்தப்பட்டதால், சிறப்பு ரயில்களை மட்டுமே ரயில்வே இயக்கி வருகிறது. நீண்ட தூர ரயில்களில் தொடங்கி, சற்று அதிக கட்டணம் கொண்ட சிறப்பு ரயில்களாக இயக்கப்படுகின்றன. குறுகிய தூர ரயில்கள் கூட சற்று கூடுதல் கட்டணத்துடன் தான் இயக்கப்படுகின்றன.. இந்நிலையில் இந்திய ரயில்வே வாரியம் அனைத்து மண்டல ரயில்வேக்கு நேற்று கடிதம் ஒன்றை அனுப்பி உள்ளது.. அந்த கடிதத்தில், ரயில்கள் வழக்கமான எண்களுடன் இயக்கப்படும் என்றும், கோவிட் தொற்றுக்கு முந்தைய வழக்கமான விலையில் ரயில் டிக்கெட் விற்கப்பட வேண்டும் என்றும் குறிப்பிட்டுள்ளது.. கோவிட் தொற்றுநோயைக் கருத்தில் கொண்டு, அனைத்து வழக்கமான சாதாரண மற்றும் எக்பிரஸ் ரயில்களும் விடுமுறை சிறப்பு ரயில்கள் என இயக்கப்பட்டன என்பது குறிப்பிடத்தக்கது. இந்நிலையில் வழக்கமான எண்கள், சம்பந்தப்பட்ட பயண வகுப்புகள் மற்றும் ரயிலின் வகைகளுக்கு பொருந்தும் கட்டணங்களுடன் ரயில்கள் இயக்கப்படும் என்று முடிவு செய்யப்பட்டுள்ளது. அதாவது கொரோனாவுக்கு முன்பு இருந்த பழைய டிக்கெட் விலையை உடனடியாக அமல்படுத்த ரயில்வே வாரியம் உத்தரவிட்டுள்ளது.. எவ்வாறாயினும், மண்டல ரயில்வே எப்போது வழக்கமான சேவைகளுக்கு திரும்ப வேண்டும் என்று அந்த உத்தரவில் குறிப்பிடப்படவில்லை. ரயில்வே மூத்த அதிகாரி ஒருவர் இதுகுறித்து பேசிய போது ரயில் கட்டணம் குறித்து மண்டல ரயில்வேக்கு அறிவுறுத்தப்பட்டுள்ளது. இந்த உத்தரவு உடனடியாக அமலுக்கு வரும் நிலையில், செயல்முறைக்கு ஓரிரு நாட்கள் ஆகும் என தெரிவித்தார். எவ்வாறாயினும், கோவிட் நோயை கருத்தில் கொண்டு அறிமுகப்படுத்தப்பட்ட சலுகைகள், படுக்கை ரோல்கள் மற்றும் உணவு சேவைகளுக்கான தற்காலிக கட்டுப்பாடுகள் போன்ற தடைகள் தொடர்ந்து அமலில் இருக்கும் என்று அதிகாரிகள் தெரிவித்தனர். எந்தவித சலுகைகள் இல்லாமல் சிறப்பு ரயில்கள் இயக்கப்பட்டதால் ரயில்வேயின் வருவாய் கணிசமான வளர்ச்சியை கண்டுள்ளது. 20212022 ஆம் ஆண்டின் இரண்டாவது காலாண்டில் பயணிகள் பிரிவில் இருந்து வருவாயில் முதல் காலாண்டுடன் ஒப்பிடும்போது 113 சதவீதம் அதிகரித்துள்ளது என்பது குறிப்பிடத்தக்கது.. Also Read : அதிக ஆபத்தான மற்றொரு புதிய வைரஸ் தொற்று.. எப்படி பரவும்..?அறிகுறிகள் என்னென்ன..? | tamil |
बिहारः लखीसराय में मुठभेड़, बालेश्वर कोरा गिरोह के तीन नक्सली हुए ढेर, हथियार बरामद बिहार में सुरक्षा बलों ने एक बार फिर नक्सलियों को मुंहतोड़ जवाब दिया है। लखीसराय जिले के पीरी बाजार थाना क्षेत्र में बुधवार की दोपहर पुलिस और नक्सली के बीच मुठभेड़ हुई। जवाबी कार्रवाई में सुरक्षा बलों ने तीन नक्सलियों को मार गिराया। सर्च ऑपरेशन के दौरान मुठभेड़ की घटना हुई, जिसमें नक्सलियों के मारे जाने के साथ ही पुलिस को हथियार बरामदगी में भी सफलता मिली है। बताया जा रहा है कि थाना क्षेत्र के घोघी कोड़ासी पहाड़ी एरिया में अर्जुन कोरा, बालेश्वर कोरा गिरोह के नक्सलियों की मौजूदगी की सूचना मिली थी। इसी सूचना के आधार पर एसपी सुशील कुमार के नेतृत्व में पुलिस, एसएसबी और एसटीएफ के जवानों ने संयुक्त रूप से सर्च ऑपरेशन चलाया। सर्च ऑपरेशन के बीच घोघी कोड़ासी में नक्सलियों से मुठभेड़ शुरू हो गई। मुठभेड़ के दौरान तीन नक्सलियों को मार गिराया गया। मारे गए नक्सलियों की पहचान बालेश्वर कोरा गिरोह के वीरेंद्र कोरा, महेंद्र कोरा और जगदीश कोरा के रूप में हुई है। हालांकि पुलिस की ताबड़तोड़ कार्रवाई के बीच नक्सलियों को बैकफुट पर जाना पड़ा और अन्य नक्सली मौके से भाग निकले। कुछ अन्य नक्सलियों के मरने और घायल होने की भी सूचना है। पुलिस अभी अन्य शवों और घायलों की तलाश में सर्च ऑपरेशन चला रही है। एएसपी अभियान मोती कुमार और एसडीपीओ रंजन कुमार ने भी मुठभेड़ में नक्सलियों के मारे जाने की पुष्टि की है। एसडीपीओ रंजन कुमार ने बताया कि नक्सलियों के मारे जाने के साथसाथ दो एसएलआर और एक पिस्टल की बरामदगी हुई है। इस सफलता से सुरक्षा बलों के जवान काफी उत्साहित हैं। इस ऑपरेशन को लेकर लखीसराय एसपी सुशील कुमार ने बताया कि पुलिस की कार्रवाई में नक्सलियों को बैकफुट पर जाना पड़ा। अभियान में बरामद हथियार पुलिस से लूटे हुए हथियार हैं। ह्यूमैन इंटेलिजेंस और टेक्निकल इंटेलिजेंस के सहयोग से इलाके में सर्च ऑपरेशन जारी है। बालेश्वर कोरा गिरोह लखीसराय एवं जमुई के इलाकों में सक्रिय है। कजरा, चानन, भीमबांध इलाकों में ज्यादा सक्रियता है। एसपी ने बताया है कि सर्च ऑपरेशन अभी चलेगा। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
As the title says, looking for two one MOC for Leia Bespin... 45A & 47A.
Last one needed to finish my Kenner run! .
I am having a bugger of a time finding the 47A.
I passed on a beater 47A a few months ago but since then I decided to get whatever I can.
The only thing that is a must is that the figure cannot be removed at all (no large cracks in the bubble or separation from the card).
I am aware that there is a 47A on eBay right now, but the bubble is cracked and based on the figure inside, my gut says it definitely was removed and the figure inside is not the one that shipped with her so I am not interested as much as I would like it to be fully legit.
So if you have either one of these MOCs or have leads, please let me know. | english |
हिजाब मामले में कर्नाटक हाईकोर्ट: छात्राओं ने दाखिल कीं नई याचिकाएं कर्नाटक हाईकोर्ट में राज्य के शिक्षण संस्थानों में हिजाब पर प्रतिबंध को चुनौती देने वाली याचिकाओं पर सुनवाई जारी है। वरिष्ठ अधिवक्ता एएम दार ने अदालत को बताया कि अदालत की ओर से व्यक्त की गई आपत्तियों को ध्यान में रखते हुए उन्होंने पांच छात्राओं की ओर से नई याचिकाएं दाखिल की हैं। अदालत इन पर 21 फरवरी को सुनवाई करेगी।याचिकाकर्ताओं की ओर से पेश हुए वरिष्ठ अधिवक्ता प्रोफेसर रवि वर्मा कुमार ने हाईकोर्ट ने अनुरोध किया है कि सुनवाई की लाइव स्ट्रीमिंग सजीव प्रसारण बंद कर दिया जाए। उन्होंने कहा कि लाइव स्ट्रीमिंग प्रतिकूल साबित हो रही है। लेकिन हाईकोर्ट ने यह मांग खारिज कर दी और कहा कि लोगों को सुनने दीजिए कि उत्तर देने वालों का इसमें क्या रुख है।कर्नाटक सरकार की ओर से पेश हुए महाधिवक्ता ने दलील दी कि राज्य सरकार का पक्ष यह है कि हिजाब इस्लाम धर्म की आवश्यक धार्मिक मान्यताओं में नहीं आता है। | hindi |
We provide a background removal service for your images with a fast turnaround time. Although this offer mentions a 3 day delivery, most of the time it is done the same day.
We pride ourselves in effective communication and making sure you are satisfied with the delivery of your order.
Once you have purchased the offer, please send us the highest resolution version of the image you have so we can provide the best results.
If you have any concerns, please do not hesitate to contact me before completing your purchase. | english |
using System.Collections.Generic;
using TvShowReminder.Contracts;
using TvShowReminder.Contracts.Dto;
using TvShowReminder.Contracts.Query;
using TvShowReminder.Contracts.Response;
using TvShowReminder.DataSource;
namespace TvShowReminder.Service.Query
{
public class AllSubscriptionsWithNextEpisodeQueryHandler : IQueryHandler<AllSubscriptionsWithNextEpisodeQuery, AllSubscriptionsWithNextEpisodeResult>
{
private readonly ISubscriptionQueryDataSource _subscriptionQueryDataSource;
private readonly IEpisodesQueryDataSource _episodesQueryDataSource;
public AllSubscriptionsWithNextEpisodeQueryHandler(ISubscriptionQueryDataSource subscriptionQueryDataSource,
IEpisodesQueryDataSource episodesQueryDataSource)
{
_subscriptionQueryDataSource = subscriptionQueryDataSource;
_episodesQueryDataSource = episodesQueryDataSource;
}
public AllSubscriptionsWithNextEpisodeResult Handle(AllSubscriptionsWithNextEpisodeQuery query)
{
var subscriptions = _subscriptionQueryDataSource.GetAllSubscriptions();
var result = new List<SubscriptionWithNextEpisodeDto>();
foreach (var subscription in subscriptions)
{
result.Add(new SubscriptionWithNextEpisodeDto
{
Subscription = subscription,
NextEpisode = _episodesQueryDataSource.GetNextEpisode(subscription.Id)
});
}
return new AllSubscriptionsWithNextEpisodeResult
{
Subscriptions = result
};
}
}
}
| code |
ऑस्ट्रेलिया का पाक दौरा कंफर्म, 24 साल बाद टेस्टवनडे सीरीज की तारीख आई सामने खेल डैस्क : क्रिकेट ऑस्ट्रेलिया ने पाकिस्तान दौरे के लिए अपना कार्यक्रम जारी कर दिया है जिसमें वह पाक के तीन स्टेडियम में क्रमश: टेस्ट, वनडे सीरीज खेलेगी। दोनों टीमों के बीच 5 अप्रैल को एकमात्र टी20 भी होगा। टेस्ट सीरीज की शुरूआत 4 मार्च से होगी। ऑस्ट्रेलिया ने पाकिस्तान का दौरान 24 साल पहले किया था। 24 साल में पहली बार यह दौरा आगे बढ़ेगा। क्रिकेट ऑस्ट्रेलिया के सीईओ निक हॉकले ने कहा कि यह एक ऐतिहासिक अवसर है और खेल के वैश्विक विकास और स्वास्थ्य के लिए महत्वपूर्ण है। हॉकले ने कहा हम दो विश्व स्तरीय टीमों के बीच एक रोमांचक श्रृंखला की उम्मीद कर रहे हैं। यह दौरा पाकिस्तान के लिए एक बड़ा बढ़ावा होगा, जो उस समय बुरी तरह प्रभावित हुआ जब न्यूजीलैंड और इंग्लैंड ने सुरक्षा चिंताओं पर हाल के दौरों को छोड़ दिया था। बता दें कि 2009 में श्रीलंका टेस्ट टीम पर एक घातक आतंकी हमले के बाद से पाकिस्तान में खेलने को कोई टीम राजी नहीं थी। लेकिन अब हालात धीरेधीरे ठीक हो रहे हैं। ऑस्ट्रेलिया का पाकिस्तान दौरा टेस्ट सीरीज 48 मार्च : पहला टेस्ट रावलपिंडी में 1216 मार्च : दूसरा टेस्ट कराची में 2125 मार्च : तीसरा टेस्ट लाहौर में वनडे सीरीज 29 मार्च : पहला वनडे रावलपिंडी में 31 मार्च : दूसरा वनडे रावलपिंडी में 2 अप्रैल : तीसरा वनडे रावलपिंडी में एकमात्र टी20 5 अप्रैल रावलपिंडी में | hindi |
Ravindra Narayana Ravi: తమిళనాడు గవర్నర్గా ప్రమాణం చేసిన మాజీ ఐపీఎస్? తమిళనాడు రాష్ట్ర 26వ గవర్నర్గా మాజీ ఐపీఎస్ రవీంద్ర నారాయణ్ రవిఆర్ఎన్ రవి ప్రమాణ స్వీకారం చేశారు. చెన్నైలోని రాజ్భవన్లో సెప్టెంబర్ 18న జరిగిన కార్యక్రమంలో మద్రాస్ హైకోర్టు ప్రధాన న్యాయమూర్తి సంజిబ్ బెనర్జీ ఆయనతో ప్రమాణ స్వీకారం చేయించారు. కార్యక్రమానికి రాష్ట్ర ముఖ్యమంత్రి సీఎం ఎంకే స్టాలిన్, ప్రతిపక్ష నేత కె. పళనిస్వామి హాజరయ్యారు. మాజీ ఐపీఎస్ అయిన ఆర్ఎన్ రవి 2014 ఆగస్టు 29న నాగా శాంతి చర్చల్లో కేంద్ర తరఫున నియమితులయ్యారు. 2019 ఆగస్టు 1 నుంచి 2021 సెప్టెంబర్ 15 వరకు నాగాలాండ్ గవర్నర్గా పని చేశారు. ఇప్పటి వరకూ తమిళనాడు గవర్నర్గా పని చేసిన భన్వరిలాల్ పురోహిత్ పంజాబ్ గవర్నర్గా బదిలీ అయ్యారు. చదవండి: ఉత్తరాఖండ్ గవర్నర్గా ప్రమాణం చేసిన సైన్యాధికారి? క్విక్ రివ్యూ : ఏమిటి : తమిళనాడు రాష్ట్ర 26వ గవర్నర్గా ప్రమాణ స్వీకారం ఎప్పుడు : సెప్టెంబర్ 18 ఎవరు : మాజీ ఐపీఎస్ రవీంద్ర నారాయణ్ రవిఆర్ఎన్ రవి ఎక్కడ : రాజ్భవన్, చెన్నై ఎందుకు : ఇప్పటి వరకూ తమిళనాడు గవర్నర్గా పని చేసిన భన్వరిలాల్ పురోహిత్ పంజాబ్ గవర్నర్గా బదిలీ అయిన నేపథ్యంలో... | telegu |
## EXAMINATION:
CTA CHEST WITH CONTRAST
## INDICATION:
year old man with pulmonary HTN, ? clotting disorder //
Please assess for chronic thromboembolic pulmonary hypertension
## DOSE:
Acquisition sequence:
1) Stationary Acquisition 3.0 s, 0.5 cm; CTDIvol = 4.9 mGy (Body) DLP = 2.4
mGy-cm.
2) Spiral Acquisition 3.5 s, 27.6 cm; CTDIvol = 7.7 mGy (Body) DLP = 212.4
mGy-cm.
Total DLP (Body) = 215 mGy-cm.
## FINDINGS:
Thyroid gland is unremarkable in appearance. There are a few mediastinal
lymph nodes that are not pathologically enlarged by CT size criteria.
Similarly, no supraclavicular, axillary or hilar lymphadenopathy by size
criteria.
Patient is status post heart transplantation, with stable mild enlargement of
the heart. No pericardial effusion. Thoracic aorta is normal in course and
caliber, without atherosclerotic calcifications. Swan-Ganz catheter
terminates in the right pulmonary artery. Pulmonary arteries are well
opacified to the proximal subsegmental levels, without evidence of pulmonary
embolism.
There is diffuse bronchial wall thickening. Several areas of mucous plugging
are noted within segmental lower lobe bronchi bilaterally (3: 122, 124).
Evaluation of the lung parenchyma reveals persistent peribronchial
opacification between the right upper and middle lobes (3:87), which appears
similar to the prior chest CT of . Associated bronchiectasis
(3:90) is again noted, presumably post-infectious. No new concerning
parenchymal opacities are identified. There is no pneumothorax or pleural
effusion.
Limited evaluation of the upper abdomen reveals no gross abnormalities.
Compression fractures involving multiple thoracic vertebral bodies are again
noted. Post sternotomy, with intact wires. No concerning lytic or sclerotic
lesion is identified.
Bilateral gynecomastia.
## IMPRESSION:
1. No evidence of pulmonary embolism or aortic abnormality.
2. Mucous plugging involving the segmental lower lobe airways bilaterally.
3. Stable appearance of peribronchial opacity and presumably postinfectious
bronchiectasis on the right. No new concerning parenchymal opacity.
| medical |
گیانااردو پوائنٹ اخبارتازہ ترین ئی این پی 10 اپریل2017ء پاکستان ون ڈے ٹیم کے کپتان سرفراز احمد نے کہا ہے کہ ویسٹ انڈیز کیخلاف دوسرے ون ڈے میں کھلاڑیوں نے شاندارپرفارمنس دیکامیابی پربہت خوشی ہےفائنل میں پوری کوشش کرکے کامیابی حاصل کریں گے ویسٹ انڈیز میں دوسرے ٹی 20 میں فتح کے بعد گفتگو کرتے ہوئے انہوں نے کہا کہ عماداورحسن علی نے بہترین کھیل کامظاہرہ کیا کھلاڑیوں سے بیٹھ کربات کریں گے اورخامیوں کودورکریں گےسرفراز احمد مزید کہا کہ کھلاڑیوں کوڈانٹتانہیںبس سوفیصدپرفارمنس لانیکی کوشش کرتاہوںنئے کھلاڑی ہیں اورتھوڑی ڈانٹ ڈپٹ ضروری ہوتی ہےادھرویسٹ انڈیزکے کپتان جیسن ہولڈر کہتے ہیں پاکستانی ٹیم نے بہترکھیل پیش کیاانکو کریڈٹ دیناچاہیےہماری ٹیم کومستقل مزاجی سے بہترپرفارمنس دینی ہوگیامید ہے فائنل میچ میں اچھا کھیل پیش کرکے سیریز جیتیں گے | urdu |
ITCના શેર 1 સપ્તાહમાં 5.50 તૂટ્યા, એક્સપર્ટથી જાણો શું આ રોકાણની યોગ્ય તક નાણકીય વર્ષ 202122 માટે 6.25 રૂપિયા પ્રતિ શેર ફાઈનલ ડિવિડેન્ડની જાહેરાત બાદથી ITCના શેર દબાણમાં જોવા મળી રહ્યા છે. આજના કારોબારમાં આઈટીસીના શેક લગભગ 4.50 રૂપિયા ડાઉન સાઈડ ગેપની સાથે ખુલ્યો હતો. તેના બાદ આ સવારે શરૂઆતી કારોબારમાં લગભગ 2.75 ટકાના ઘટાડાની સાથે 263.85 રૂપિયાના ઈન્ટ્રાડે લો પર જતો જોવા મળ્યો. છેલ્લા 1 સપ્તાહ દરમિયાન આઈટીસીના શેર 281 રૂપિયાથી 265 રૂપિયા પર આવી ગયો છે. આ સમયમાં તેમાં લગભગ 5.50 ટકાનો ઘટાડો જોવા મળ્યો છે. જો કે સ્ટૉક માર્કેટના એક્યપર્ટ આઈટીસીના શેરોમાં આવ્યો આ ઘટાડાને ખરીદારીની સારી તક બનાવી રહી છે. બજારના જાણકારોનું કહેવું છે કે આ ડિવિડેન્ડ પેઇન્ગ સ્ટૉક આવતા 12 મહિનામાં 340 રૂપિયાના સ્તર પર પહોંચતો જોવા મળી રહ્યો છે. આઈટીસીના શેરો પર વાત કરતા GCL Securitiesના રવિ સિંઘલનું કહેવું છે કે આઈટીસી એક સારી રીતે ડાયવર્સિફાઈડ કંપની છે. કોવિડને કારણે લાગૂ રોકને કારણે આ સ્ટૉક લાંહા સમયથી સાઈડવેઝ રહ્યા છે. કોવિડને રોકને હટાવાની સાથે આ સ્ટૉકમાં તેજી આવવાની આશા છે. આ સ્ટૉકએ હાલને કારોબારી સત્રોમાં 252 રૂપિયાને ઉપર ક્લોઝિંગ આપતા કંસોલિડેશનથી બહાર આવવાના સંકેત આપે છે. એવામાં આ સ્ટૉકમાં 244 રૂપિયાના સ્ટૉપલોસની સાથે 12 મહિનાના 320340 રૂપિયાના લક્ષ્ય માટે ખરીદી શરૂ કરવા માંગે છે. જે લોકો આ સ્ટૉકમાં નવું રોકાણ કરવા માંગે છે અને દેનું રોકાણ લાંબા સમય છે તેનો રવિ સિંઘલની સલાહ છે કે આઈટીસીમાં વર્તમાન લેવલ પર પણ 2444 રૂપિયાના સ્ટૉપલોસ સાથે 12 મહિના માટે 320 રૂપિયાથી 340 રૂપિયાના લક્ષ્ય માટે ખરીદી કરવું જોઈએ. Swastik Investmartના સંતોષ મીણનું કહેવું છે કે પોઝિશનલ ઇન્વેસ્ટરોને આ સ્ટૉકમાં ખરીદી કરવાની લાંબા સમય માટે બન્યા રહેવું જોઈએ. સ્ટૉકના વલ્યૂએશન ઘણી સારી છે અને આ એક ડિફેન્સિવ સ્ટૉક છે. લાંબા સમયમાં આ સ્ટૉક સારૂ રિટર્ન આપતા જોવા મળી શકે છે. આ રિતે Edelweiss Wealthનું માનવું છે કે આઈટીસીના શેર કંસોલિડેશનના દરમિયાન બહાર આવ્યો છે અને લાંબા સમયમાં તેમાં 450 રૂપિયાના સ્તર જોવા મળી શકે છે. Edelweiss Wealthના આ સ્ટૉકમાં 220 રૂપિયાના સ્ટૉપલોસ સાથે ખરીદી કરવાની સલાહ છે. ડિસ્ક્લેમર: મનીકંટ્રોલ.કૉમ પર આપેલા વિચાર એક્સપર્ટના તેના ખાનગિ વિચાર હોય છે. વેબસાઈટઆ મેનેજમેન્ટ આ માટે જવાબદાર નથી. યુઝર્સને મનીકંટ્રોલની સલાહ આપે છે કે કોઈપણ રોકાણ નિર્ણય લેતા પહેલા હંમેશા સર્ટિફાઈડ એક્સપર્ટની સલાહ લો. | gujurati |
അവിശ്വാസം പാസായി: എരുമേലിയില് ഭരണം കൈയടക്കി ഇടതുപക്ഷം എരുമേലി: പഞ്ചായത്തില് ഭരണം കൈയടക്കി ഇടതുപക്ഷം. കോണ്ഗ്രസ് പിന്തുണയുള്ള വൈസ് പ്രസിഡന്റ് ഇ.ജെ. ബിനോയിക്കെതിരേ എല്ഡിഎഫ് നല്കിയ അവിശ്വാസ പ്രമേയം പാസായി. ഇതോടെ കോണ്ഗ്രസ് പുലര്ത്തിയിരുന്ന സ്വാധീനം നഷ്ടമായെന്നും ഇനി എല്ഡിഎഫിന്റെ നേതൃത്വത്തില് ഭരണസ്ഥിരത കൈവരുമെന്നും പഞ്ചായത്ത് പ്രസിഡന്റ് തങ്കമ്മ ജോര്ജ്കുട്ടി പറഞ്ഞു. വികസന പ്രവര്ത്തനങ്ങളിലെ മാന്ദ്യം മാറ്റി അവിശ്വാസത്തില് വഴങ്ങി സിപിഎം: നേട്ടം സിപിഐക്ക് പഞ്ചായത്ത് വൈസ് പ്രസിഡന്റിനെതിരേ അവിശ്വാസ പ്രമേയം പാസാക്കാന് എല്ഡിഎഫിന് കഴിഞ്ഞെങ്കിലും ഇതിനായി സമ്മര്ദത്തിലായത് സിപിഎം. സിപിഐക്ക് ഇനിയുള്ള രണ്ട് വര്ഷം വൈസ് പ്രസിഡന്റ് പദവി നല്കണമെന്ന ആവശ്യമാണ് സിപിഎമ്മിനെ സമ്മര്ദത്തിലാക്കിയത്. ഒടുവില് ഈ ആവശ്യത്തിന് സിപിഎം വഴങ്ങേണ്ടി വന്നു. അവിശ്വാസ പ്രമേയ യോഗത്തിന് മണിക്കൂറുകള്ക്ക് മുമ്ബ് ഇക്കാര്യത്തില് ഉറപ്പ് കിട്ടി എല്ഡിഎഫില് കരാര് എഴുതി ഒപ്പ് വച്ച ശേഷമാണ് യോഗത്തില് സിപിഐ അംഗം പങ്കെടുത്ത് പ്രമേയത്തെ അനുകൂലിച്ച് വോട്ട് ചെയ്തതെന്ന് സിപിഐ നേതാക്കള് പറയുന്നു. ചെറുവള്ളി എസ്റ്റേറ്റ് വാര്ഡിനെ പ്രതിനിധീകരിക്കുന്ന അനിശ്രീ സാബുവാണ് സിപിഐയുടെ ഏക അംഗം. പക്ഷെ കോണ്ഗ്രസില് നിന്ന് കാല് മാറിയ പ്രകാശ് പള്ളിക്കൂടം കൂടി അനുകൂലമായാലാണ് ഭൂരിപക്ഷം ലഭിക്കുക. പ്രകാശ് പള്ളിക്കൂടത്തിന് വൈസ് പ്രസിഡന്റ് പദവി നല്കാമെന്ന ധാരണയിലാണ് സിപിഎം നേതൃത്വം അവിശ്വാസ പ്രമേയത്തിനുള്ള നടപടികള് തുടങ്ങിയതെന്ന് പറയുന്നു. പരാജയത്തിന്റെ തുടര്ച്ചയില് കോണ്ഗ്രസ് എല്ഡിഎഫിന്റെ അവിശ്വാസ പ്രമേയം പാസായതോടെ എരുമേലിയില് കോണ്ഗ്രസ് നേരിട്ടുകൊണ്ടിരിക്കുന്നത് തുടര്ച്ചയായ പരാജയം. ഇനി കോണ്ഗ്രസിന്റെ കൈവശമുള്ളത് വിവിധ സ്റ്റാന്ഡിംഗ് കമ്മിറ്റികളുടെ അധ്യക്ഷ പദവികളാണ്. വൈസ് പ്രസിഡന്റ് പദവി ഇനി എല്ഡിഎഫ് തിരിച്ചു പിടിക്കുന്നതോടെ സ്റ്റാന്ഡിംഗ് കമ്മിറ്റികളും പിടിച്ചെടുക്കും. പത്ത് അംഗങ്ങളുള്ള ഏറ്റവും വലിയ ഒറ്റക്കക്ഷി ആയിട്ടും ഭരണം പിടിക്കാനായില്ല. ഒടുവില് കോണ്ഗ്രസിലെ ഒരു അംഗം കാല് മാറി എല്ഡിഎഫിനൊപ്പം ചേര്ന്നതും നേതൃത്വത്തെ വെട്ടിലാക്കിയിരുന്നു. ഇതെല്ലാം ഇനി കോണ്ഗ്രസ് നേതൃത്വത്തില് സമൂലമായ അഴിച്ചുപണിക്ക് കാരണമായി മാറുമെന്നാണ് സൂചനകള്. കൂറുമാറിയ പ്രകാശ് പള്ളിക്കൂടത്തെ അയോഗ്യനാക്കണമെന്ന് തെരഞ്ഞെടുപ്പ് കമ്മീഷന് നല്കിയ പരാതി മാത്രമാണ് ഇനി കോണ്ഗ്രസിനുള്ള ഏക തുറുപ്പുചീട്ട്. അവിശ്വാസത്തിലും കോവിഡ് ഇന്നലെ പഞ്ചായത്ത് വൈസ് പ്രസിഡന്റിനെതിരേ എല്ഡിഎഫിന്റെ അവിശ്വാസം പാസാകും മുമ്ബുള്ള ചര്ച്ചയില് നിറഞ്ഞത് മൊത്തം കോവിഡ്. അവിശ്വാസ പ്രമേയം അവതരിപ്പിക്കാനുള്ള കാരണങ്ങളായി എല്ഡിഎഫ് ഉന്നയിച്ചത് കോവിഡ് പ്രതിരോധ പ്രവര്ത്തനങ്ങള്ക്ക് വൈസ് പ്രസിഡന്റ് തടസം നില്ക്കുന്നെന്ന ആരോപണമാണ്. കോവിഡ് ചികിത്സ ഉള്പ്പെടെയുള്ള പ്രതിരോധ പ്രവര്ത്തനങ്ങള്ക്കുള്ള ബില്ലുകള് വൈസ് പ്രസിഡന്റ് ഇ.ജെ. ബിനോയ് തടഞ്ഞുവെച്ചെന്ന് സിപിഎം അംഗങ്ങള് ആരോപിച്ചു. അവിശ്വാസ പ്രമേയത്തിന് എന്തെങ്കിലും ഒരു കാരണം പറയാന് വേണ്ടി മാത്രം ഉന്നയിച്ച ആരോപണം മാത്രമാണിതെന്ന് കോണ്ഗ്രസ് അംഗങ്ങള് മറുപടി നല്കി. കോവിഡ് പ്രതിരോധത്തിന്റെ മറവില് സാമ്ബത്തിക അഴിമതി നടത്താനുള്ള നീക്കങ്ങള് തടഞ്ഞിട്ടുണ്ടെന്നും മറിച്ചുള്ള ആരോപണം അടിസ്ഥാന രഹിതമാണെന്നും കോണ്ഗ്രസ് പാര്ലമെന്ററി ലീഡര് രാജപ്പന് നായര് പറഞ്ഞു. ഭരണത്തിന് ആറ് മാസത്തെ ആയുസ്: കോണ്ഗ്രസ് വൈസ് പ്രസിഡന്റിനെതിരേ അവിശ്വാസ പ്രമേയം പാസാക്കി എല്ഡിഎഫ് ഭരണം പിടിച്ച എരുമേലിയില് ഭരണത്തിന് ആറ് മാസത്തെ ആയുസേയുള്ളെന്ന് കോണ്ഗ്രസ്. വരുന്ന ആറ് മാസത്തിനുള്ളില് എല്ഡിഎഫിനെതിരേ അവിശ്വാസ പ്രമേയം കൊണ്ടുവരുമെന്ന് കോണ്ഗ്രസ് അംഗം നാസര് പനച്ചി അറിയിച്ചു. കോണ്ഗ്രസില് നിന്ന് കൂറുമാറിയ അംഗത്തിനെതിരേ തെരഞ്ഞെടുപ്പ് കമ്മീഷന് ആറ് മാസത്തിനുള്ളില് നടപടികള് സ്വീകരിക്കുമെന്നും ഇതോടെ എല്ഡിഎഫിന് ഭൂരിപക്ഷം നഷ്ടമാകുമെന്നും നാസര് പനച്ചി പറഞ്ഞു. | malyali |
अरबपति निवेशक ने क्रिप्टोकरेंसी को बताया अत्यंत घृणा के योग्य, कहा जुआ है ये नई दिल्ली. दिग्गज निवेशक वॉरेन बफे Warren Buffet के बिजनेस पार्टनर और बर्कशायर हेथवे Berkshire Hathaway के वाइस चेयरमैन चार्ली मंगर Charlie Munger ने क्रिप्टोकरेंसी cryptocurrency पर रोक लगाने की मांग करते हुए इसे अत्यंत घृणा के योग्य Beneath Contempt बताया है. उन्होंने इसकी तुलना गंभीर बीमारी से की है. मंगर ने क्रिप्टोकरेंसी पर चीन के बैन लगाने की प्रशंसा करते हुए कहा कि चीन ने सही कदम उठाया है. वहीं अमेरिका ने इसे स्वीकार कर गलती की है. यह पहली बार नहीं है जब इस दिग्गज निवेशक ने क्रिप्टोकरेंसी की आलोचना की है. लॉस एंजिल्स के समाचार पत्र डेली जर्नल कॉर्प की जनरल मीटिंग में इस अरबपति निवेशक से क्रिप्टो Crypto के बारे में पूछा गया था. मंगर ने इसके जवाब में कहा कि मैंने क्रिप्टोकरेंसी में निवेश नहीं किया है. और मुझे इस पर गर्व है कि मैंने क्रिप्टो की उपेक्षा की है. यह गंभीर रोग की तरह है. इसे में अत्यंत घृणा के योग्य Beneath Contempt मानता हूं. कुछ लोग इसे आधुनिकता Modernity मान रहें है और वे एक ऐसी करेंसी का स्वागत कर रहे हैं जो फिरौती और किडनेपिंग में सहायक है और आगे कर चोरी में भी होगी. पहले जुए से की थी तुलना पहले भी चार्ली मंगर क्रिप्टोकरेंसी की तुलना जुए Gambling से कर चुके हैं. अब एक बार फिर उन्होंने कहा कि क्रिप्टोकरेंसी को ऐसे मुट्ठीभर लोग चला रहे हैं जो जल्दी से जल्दी अमीर होना चाहते हैं. मंगर ने कहा कि अगर मैं विश्व का तानाशाह होता तो मैं प्रतिभूतियों Securities में शार्ट टर्म लाभ कमाने को अव्यवहारिक बना देता. ऐसा इसलिए करता क्योंकि वर्तमान में हमने पूंजी जुटाने की वैध गतिविधियों को गैंबलिंग कैसीनो के साथ मिला दिया है जहां लोग आते हैं और जुआ खेलते हैं. इन दोनों स्टॉक मार्केट Stock Market और बिटकॉइन Bitcoin के मेल ने एक अव्यवहारिक मिश्रण पैदा कर दिया है जो गणराज्य USA के लिए बहुत खतरनाक है. मंगेर का मानना है कि बिटकॉइन ऐसा एसेट है, जिसका कोई वर्थ नहीं है. इसमें सिर्फ सट्टेबाजी की जा सकती है. डिजिटल करेंसी के पक्ष में भी नहीं मंगर फेडरल रिजर्व के डिजिटल करेंसी Digital Currency लाने के पक्ष में भी नहीं हैं. वो उसे उपयोगी नहीं मानते. उन्होंने कहा कि पहले से हमारे पास डिजिटल करेंसी है, जिसे बैंक अकाउंट कहा जाता है. बैंक्स फेडरल रिजर्व के सिस्टम के साथ जुड़े हुए हैं. इसलिए डिजिटल करेंसी की क्या जरूरत है. | hindi |
நடிகை த்ரிஷா தெலுங்கு வெப் சீரீஸில் நடிக்கிறார் நடிகை த்ரிஷா வெப் சீரீஸில் நடிக்கவிருக்கிறார். தமிழில் அல்ல தெலுங்கில் தயாராகும் பிருந்தா என்ற வெப் சீரீஸில்..! இந்த வெப் சீரீஸை அவினாஷ் கொல்லா என்னும் கலை இயக்குநர் தயாரிக்கவிருக்கிறார். இவர் தெலுங்கு திரையுலகத்தின் முன்னணி கலை இயக்குநர்களில் ஒருவர். இந்த வெப் சீரீஸ் சோனி லைவ் ஓடிடி தளத்தில் வெளியாகவுள்ளதாம். பெண் கதாபாத்திரத்தை மையமாக வைத்து உருவாகும் இந்த வெப் சீரீஸின் கதையைக் கேட்டவுடன் த்ரிஷா இதில் நடிக்க ஒத்துக் கொண்டிருக்கிறார். கிரைம், திரில்லர் சப்ஜெக்ட்டில் இந்த சீரீஸ் எடுக்கப்படவுள்ளது. சூர்யா வெங்கலா என்ற இயக்குநர் இந்த சீரீஸை இயக்கவுள்ளார். சக்திகாந்த் கார்த்திக் இசையமைக்கிறார். த்ரிஷாவுடன் சாய் குமார், ஆம்னி, இந்திரஜித் சுகுமாரன், ரவீந்திர விஜய், ஆனந்த்சாமி மற்றும் பலர் நடிக்கவுள்ளனர். இந்த சீரீஸின் துவக்க விழா விஜயதசமி நாளன்று நடந்தது. மேலும் ஒரு கன்னட படத்தில் புனித் ராஜ்குமாருக்கு ஜோடியாகவும் த்ரிஷா நடிக்கவுள்ளார். இந்தப் படத்தை இயக்குநர் பவன் இயக்கவுள்ளார். | tamil |
سٕنِہ کٕشیر چھ ٲسمٕژ گۅڈنؠتھ اکھ سؠٹھا خوٗبصوٗرت سَر | kashmiri |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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 org.apache.nifi.cluster.event.impl;
import org.apache.nifi.cluster.event.impl.EventManagerImpl;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import org.apache.nifi.cluster.event.Event;
import org.apache.nifi.cluster.event.Event.Category;
import org.apache.nifi.cluster.event.EventManager;
import org.junit.Test;
import static org.junit.Assert.*;
/**
* @author unattributed
*/
public class EventManagerImplTest {
@Test(expected = IllegalArgumentException.class)
public void testNonPositiveHistorySize() {
new EventManagerImpl(0);
}
@Test
public void testGetEventsUnknownSource() {
EventManager manager = new EventManagerImpl(1);
assertEquals(Collections.EMPTY_LIST, manager.getEvents("unknown value"));
}
@Test
public void testGetEvents() {
EventManager manager = new EventManagerImpl(2);
Event e1 = new Event("1", "Event1", Category.INFO, 0);
Event e2 = new Event("1", "Event2", Category.INFO, 1);
manager.addEvent(e1);
manager.addEvent(e2);
List<Event> events = manager.getEvents("1");
// assert newest to oldest
assertEquals(Arrays.asList(e2, e1), events);
}
@Test
public void testGetMostRecentEventUnknownSource() {
EventManager manager = new EventManagerImpl(1);
assertNull(manager.getMostRecentEvent("unknown value"));
}
@Test
public void testGetMostRecentEvent() {
EventManager manager = new EventManagerImpl(2);
Event e1 = new Event("1", "Event1", Category.INFO, 0);
Event e2 = new Event("1", "Event2", Category.INFO, 1);
manager.addEvent(e1);
manager.addEvent(e2);
// assert newest to oldest
assertEquals(e2, manager.getMostRecentEvent("1"));
}
@Test
public void testAddEventExceedsHistorySize() {
EventManager manager = new EventManagerImpl(1);
Event e1 = new Event("1", "Event1", Category.INFO, 0);
Event e2 = new Event("1", "Event2", Category.INFO, 1);
manager.addEvent(e1);
manager.addEvent(e2);
List<Event> events = manager.getEvents("1");
// assert oldest evicted
assertEquals(Arrays.asList(e2), events);
}
@Test
public void testClearHistory() {
EventManager manager = new EventManagerImpl(1);
Event e1 = new Event("1", "Event1", Category.INFO, 0);
Event e2 = new Event("1", "Event2", Category.INFO, 1);
manager.addEvent(e1);
manager.addEvent(e2);
manager.clearEventHistory("1");
// assert oldest evicted
assertTrue(manager.getEvents("1").isEmpty());
}
}
| code |
16 કિમી પ્રતિ કલાકની ઝડપે આગળ વધી રહ્યું છે આસાની 24 કલાકમાં ગંભીર ચક્રવાતી તોફાનમાં ફેરવાશે બંગાળની ખાડી પરનું ડીપ પ્રેશર એરિયા ચક્રવાત આસાનીમાં ફેરવાઈ ગયું છે. હવામાનશાસ્ત્રીઓનું કહેવું છે કે આ ચક્રવાત આજે સાંજ સુધીમાં પોતાની અસર બતાવશે. તે ઉત્તરપશ્ચિમ તરફ આગળ વધીને 24 કલાકની અંદર પૂર્વમધ્યમાં તીવ્ર ચક્રવાતી વાવાઝોડામાં ફેરવાય તેવી શક્યતા છે. IMDના વરિષ્ઠ વૈજ્ઞાનિક ઉમાશંકર દાસે જણાવ્યું કે ચક્રવાત આસાની ઉત્તરપશ્ચિમ દિશામાં 16 કિમી પ્રતિ કલાકની ઝડપે આગળ વધી રહ્યું છે. તે વિશાખાપટ્ટનમથી દક્ષિણપૂર્વ દિશામાં 970 કિમી અને પુરીથી દક્ષિણપૂર્વ દિશામાં 1020 કિમીના અંતરે છે. તેમણે કહ્યું કે, તે 10 મેની સાંજ સુધીમાં ઉત્તરપશ્ચિમ દિશામાં આગળ વધશે અને ઓડિશાના કિનારે સમાંતર આગળ વધશે. તેમણે કહ્યું કે, 10 મે સુધીમાં તે ઉત્તર આંધ્ર પ્રદેશ અને ઓડિશાના દરિયાકાંઠે પહોંચી શકે છે. આ પછી 10 મેની સાંજથી વરસાદ શરૂ થશે. ઓડિશાના ત્રણ જિલ્લા ગજપતિ, ગંજમ અને પુરી માટે વરસાદ માટે યલો એલર્ટ જારી કરવામાં આવ્યું છે. 11મી મેના રોજ પાંચ જિલ્લામાં ભારે વરસાદની સંભાવના છે. માછીમારો માટે એલર્ટ જારી ભારતીય હવામાન વિભાગ દ્વારા માછીમારોને લઈને એલર્ટ જાહેર કરવામાં આવ્યું છે. કહેવામાં આવ્યું છે કે 10 મે સુધી તેઓ પશ્ચિમ બંગાળ અને ઓડિશાના દરિયાકિનારા સુધી ન જાય. 9 મે અને 10 મેના રોજ ઓડિશાના દરિયાકાંઠે સમુદ્રની સ્થિતિ ખરાબ રહેશે. આ દરમિયાન તે 8090 કિમી પ્રતિ કલાકની ઝડપે રહેશે, જે 11 મે સુધી રહેશે. આ રાજ્યોમાં તેની અસર જોવા મળશે ચક્રવાતી તોફાન આસાનીની અસર સૌથી વધુ ઓડિશા અને પશ્ચિમ બંગાળમાં જોવા મળવાની ધારણા છે. આ સિવાય બિહાર, ઝારખંડ, સિક્કિમ, આસામ, આંધ્રપ્રદેશમાં પણ તેની અસર જોવા મળશે. હવામાન વિભાગ દ્વારા આ તમામ રાજ્યો માટે એલર્ટ જારી કરવામાં આવ્યું છે. IMDએ જણાવ્યું કે મંગળવારથી ઓડિશાના દરિયાકાંઠાના જિલ્લાઓ અને કોલકાતા સહિત પશ્ચિમ બંગાળના દક્ષિણ ભાગોમાં હળવાથી મધ્યમ વરસાદની શક્યતા છે. | gujurati |
সুস্বাদু স্ন্যাক্স ব্রেড পিজ্জা, জেনে নিন রেসিপি ব্রেড পিজ্জা তৈরির উপকরণ ৬ টি স্যান্ডউইচ ব্রেড স্লাইস, প্রয়োজন মত মাখন, পিজ্জা সস,প্রয়োজন হিসাবে, ১ টি মাঝারি পেঁয়াজ, ১টি মাঝারি ক্যাপসিকাম, ১ টি মাঝারি টমেটো, ৫৬ টি জলপাই , প্রয়োজনীয় অরিগানো, প্রয়োজন মতো শুকনো তুলসী, ১ থেকে ১.২৫ কাপ গ্রেটেড মোজারেলা পনির বা পিজ্জা পনির, রেড চিলি ফ্লেক্স পদ্ধতি ব্রেড পিজ্জা তৈরি করতে প্রথমে একটি প্যান গরম করুন এবং তাতে প্রায় আধা থেকে ১ চা চামচ অলিভ অয়েল ছড়িয়ে দিন আঁচ কম রাখুন এবার এতে পাঁউরুটির স্লাইস দিন এবং এর বেস হালকাভাবে টোস্ট করুন এবং উল্টে দিন এর পরে, হালকা টোস্ট করা জায়গায় দ্রুত কিছু পিজ্জা সস ছড়িয়ে দিন আপনি উপরে পেঁয়াজ এবং সব সবজি রাখুন মনে রাখবেন টপিং যোগ করার সময়, আঁচ কম রাখতে হবে এছাড়াও গোলমরিচ গুঁড়ো যোগ করুন এবার উপরে গ্রেট করা মোজারেলা চিজ বা পিজ্জা চিজ দিনআঁচ কমিয়ে ব্রেড পিজ্জার উপর ঢাকনা দিন পনির গলে যাওয়া এবং রুটি টোস্ট না হওয়া পর্যন্ত রান্না করুন প্যান থেকে বের করে সার্ভিং প্লেটে রেখে তাতে লাল লংকার গুঁড়ো ছিটিয়ে দিন ব্রেড পিজ্জা প্রস্তুত কেচাপ বা পিজ্জা সসের সাথে গরম গরম পরিবেশন করতে পারেন | bengali |
இஸ்ரேலின் இரட்டைத் தொற்று: புதிய ஃபுளோரனா! பெருந்தொற்றுப் பரவலின் மத்தியில் இஸ்ரேலில் அடையாளம் காணப்பட்டிருக்கும் புதிய தொற்றுக்கு, அந்நாட்டு மருத்துவர்கள் ஃபுளோரனா என பெயரிட்டிருக்கிறார்கள்.கரோனாவின் ஆல்ஃபா, பீட்டாவில் தொடங்கி தற்போது அதிகம் பரவிவரும் ஒமைக்ரான் வரை பல்வேறு திரிபுகள் அடையாளம் காணபட்டுள்ளன. கரோனாவின் புதிய திரிபுகள் மட்டுமே கவலை தந்து வந்த நிலையில், ஒரே நபர் 2 விதமான வைரஸ் தொற்றுக்கு ஆளாவதையும் கண்டறிந்து வருகிறார்கள்.உதாரணமாக, டெல்டா திரிபு பாதித்த நபரை ஒமைக்ரானும் பாதிப்பதால் உருவாகும் புதிய தொற்றுக்கு டெல்மைக்ரான் என்று பெயரிட்டார்கள். இங்கிலாந்து, அமெரிக்கா மற்றும் சில ஐரோப்பிய நாடுகளில் கட்டுக்கடங்காது கரோனா பரவுவதற்கு இந்த டெல்மைக்ரானே காரணம் எனவும் மருத்துவ ஆய்வாளர்கள் கூறினார்கள். மும்பையில் தொடங்கி இங்கிலாந்து வரை இது குறித்து வெளியான மருத்துவ கருத்துகள் முழுமையாக உறுதி செய்யப்படவில்லை. ஆய்வின் அடிப்படையிலேயே இருக்கும் டெல்மைக்ரானை உலக சுகாதார நிறுவனம் இன்னமும் அங்கீகரிக்கவில்லை.இந்நிலையில், இஸ்ரேல் தேசத்தில் கரோனா தொற்றும், சாதாரண காய்ச்சல் தொற்றான இன்ஃபுளுயன்சாவும் ஒரே நேரத்தில் ஒருவரை பாதித்திருப்பதைக் கண்டறிந்துள்ளனர். மகப்பேறுக்காக மருத்துவமனையில் அனுமதிக்கப்பட்ட கர்ப்பிணி ஒருவருக்கு இம்மாதிரி, ஒரேநேரத்தில் இருவேறு தொற்றுகள் இருப்பது உறுதி செய்யபட்டுள்ளது.கரோனாவுக்கு எதிரான விழிப்புணர்வில் இஸ்ரேல் தேசம், தனது குடிமக்களுக்கு இதுவரை 4 டோஸ் தடுப்பூசிகளை செலுத்தி வருகிறது. இவற்றின் மத்தியில் தற்போது இன்ஃபுளுயன்சா காய்ச்சல் இஸ்ரேலில் அதிக அளவில் பரவி வருகிறது. அந்த வகையில் கரோனா தடுப்பூசி எடுத்துக்கொள்ளாத நிறைமாத கர்ப்பிணி, ஒரே நேரத்தில் 2 தொற்றுக்கும் ஆளாகி உள்ளார். இஸ்ரேல் மருத்துவர்கள், இந்த இரட்டைத் தொற்று பாதிப்புக்கு ஃபுளோரனா எனப் பெயரிட்டு ஆராய்ந்து வருகின்றனர்.டெல்டாவும் ஒமைக்ரானும் போட்டியிட்டு பரவிவருகையில், இஸ்ரேல் இரட்டைத் தொற்றை உறுதி செய்திருப்பது, கரோனா தடுப்பு நடவடிக்கைகளில் உலக மக்கள் எச்சரிக்கையாக இருக்க வேண்டியதன் அவசியத்தை வலியுறுத்துகிறது. | tamil |
کولمبوکولمبو ٹیسٹ کے تیسرے روز پاکستان نے 551 رنز کھلاڑی پر اننگز ڈکلیئر کردی کولمبو کے سنہالیز اسپورٹس کلب گرانڈ پر کھیلے جارہے دوسرے ٹیسٹ کے تیسرے روز پاکستان نے 488 رنز چار کھلاڑی پر اپنی نامکمل اننگز کا غاز کیا اسد شفیق اور عدنان اکمل رنز بناکر ہوئے اس طرح اسکور میں 63 رنز کے اضافے کے بعد پاکستان نے اننگز ڈکلیئر کرنے کا اعلان کردیا کپتان مصباح الحق 66 اور عبدالرحمان 18 رنز بناکر ناٹ رہے ہیراتھ نے تین جبکہ میتھیوز اور رندیو نے ایک ایک وکٹ حاصل کی | urdu |
ਸਕ੍ਰਿਵੀ ਸਟੋਰੀਆ ਸੁ ਉਨ ਗਿਗਾਂਟੇ ਨੂਡੋ'] ", 'ਇੱਕ ਵੱਡੀ ਕਹਾਣੀ \n '] | punjabi |
Actress Surekha Passed Away: ಡಾ.ರಾಜ್ ಜೊತೆ ನಟಿಸಿದ್ದ ಸ್ಯಾಂಡಲ್ವುಡ್ ಹಿರಿಯ ನಟಿ ಸುರೇಖಾ ಇನ್ನಿಲ್ಲ..! ಬೆಂಗಳೂರುಜೂ.06: ಕನ್ನಡ ಚಿತ್ರರಂಗದ ಹಿರಿಯ ನಟಿ ಬಿ.ಜಯಾ ಸಾವಿನ ಸುದ್ದಿ ಮಾಸುವ ಮುನ್ನವೇ ಚಂದನವನಕ್ಕೆ ಮತ್ತೊಂದು ನಷ್ಟ ಆಗಿದೆ. ಸ್ಯಾಂಡಲ್ವುಡ್ನ ಮತ್ತೊಬ್ಬ ಹಿರಿಯ ನಟಿ ಸುರೇಖಾ ಇಂದು ಬೆಳಗ್ಗೆ ಬೆಂಗಳೂರಿನಲ್ಲಿ ಹೃದಯಾಘಾತದಿಂದ ಮೃತಪಟ್ಟಿದ್ದಾರೆ. ವರನಟ ಡಾ.ರಾಜ್ಕುಮಾರ್ ಸೇರಿದಂತೆ ಅನೇಕ ದಿಗ್ಗಜರ ಜೊತೆ ನಟಿಸುವ ಮೂಲಕ ಜನರ ಮನಸ್ಸನ್ನು ಗೆದ್ದಿದ್ದ ನಟಿ ಇಂದು ಇಹಲೋಕ ತ್ಯಜಿಸಿದ್ದಾರೆ. ಸುರೇಖಾ66 ಅವರಿಗೆ ನಿನ್ನೆ ರಾತ್ರಿ ಹೃದಯಾಘಾತವಾಗಿತ್ತು. ಕೂಡಲೇ ಅವರನ್ನು ಆಸ್ಪತ್ರೆಗೆ ದಾಖಲಿಸಲಾಯಿತಾದರೂ ದುರಾದೃಷ್ಟವಶಾತ್ ಬದುಕುಳಿಯಲಿಲ್ಲ. ನಿನ್ನೆ ರಾತ್ರಿ 9.30ಕ್ಕೆ ನಟಿ ಕೊನೆಯುಸಿರೆಳೆದರು. ಇಂದು ಬನಶಂಕರಿ ಚಿತಾಗಾರದಲ್ಲಿ ಸುರೇಖಾ ಅವರ ಅಂತ್ಯಕ್ರಿಯೆ ನಡೆಯಲಿದೆ. ಇವರು ಡಾ.ರಾಜ್ಕುಮಾರ್ ಅವರ ಜೊತೆ ತ್ರಿಮೂರ್ತಿ ಸಿನಿಮಾದಲ್ಲಿ ನಟಿಸುವ ಜೊತೆಗೆ, ಇನ್ನೂ 6 ಸಿನಿಮಾಗಳಲ್ಲಿ ರಾಜ್ಗೆ ಜೋಡಿಯಾಗಿ ತೆರೆ ಹಂಚಿಕೊಂಡಿದ್ದರು. ಸುರೇಖಾ ಸುಮಾರು 160ಕ್ಕೂ ಹೆಚ್ಚಿನ ಸಿನಿಮಾಗಳಲ್ಲಿ ನಟಿಸಿದ್ದಾರೆ. ಅನೇಕ ಸ್ಟಾರ್ ನಟರ ಜೊರೆ ತೆರೆ ಹಂಚಿಕೊಂಡಿದ್ದಾರೆ. ಸುರೇಖಾ ನಟಿಸಿರುವ ಚಿತ್ರಗಳಲ್ಲಿ ತ್ರಿಮೂರ್ತಿ, ಗಿರಿಕನ್ಯೆ ಸಾಕ್ಷಾತ್ಕಾರ, ಹುಲಿಯ ಹಾಲಿನ ಮೇವು, ಮಣ್ಣಿನ ಮಕ್ಕಳು, ಸಂಭ್ರಮ, ಕಿಂಗ್, ಶಂಕರ್ ಸುಂದರ್, ಬಿಳಿಗಿರಿ ಬನದಲ್ಲಿ, ಆಲೆಮನೆ ಪ್ರಮುಖವಾದವುಗಳಾಗಿವೆ.ನಟಿ ಮಾತ್ರವಲ್ಲದೇ ನೃತ್ಯಗಾರ್ತಿಯೂ ಆಗಿದ್ದ ಸುರೇಖಾ ಭರತನಾಟ್ಯ ಮತ್ತು ಕೂಚುಪಡಿಯನ್ನು ಕರಗತ ಮಾಡಿಕೊಂಡಿದ್ದರು. ಇವರ ನೃತ್ಯಕ್ಕೆ ಅಭಿಮಾನಿಗಳು ಫಿದಾ ಆಗಿದ್ದರು.ನ್ಯೂಸ್18 ಕನ್ನಡ ಕಳಕಳಿ: ಕೊರೋನಾ ಪಾಸಿಟಿವ್ ಕೇಸ್ಗಳ ಸಂಖ್ಯೆ ರಾಜ್ಯದಲ್ಲಿ ತಗ್ಗಿದೆಯಾದರೂ ಸೋಂಕಿನ ಅಪಾಯದಿಂದ ಸಂಪೂರ್ಣವಾಗಿ ಇನ್ನೂ ಯಾರೂ ಸುರಕ್ಷಿತರಲ್ಲ. ಹೀಗಾಗಿ ಪ್ರತಿಯೊಬ್ಬರು ಕೋವಿಡ್ ನಿಯಮಗಳಾದ ಮಾಸ್ಕ್ ಧರಿಸುವುದು, ಸಾಮಾಜಿಕ ಅಂತರ ಕಾಯ್ದುಕೊಳ್ಳುವುದನ್ನು ಮರೆಯಬಾರದು. ಆದಷ್ಟು ಶೀಘ್ರವೇ ಲಸಿಕೆ ಪಡೆದು ಸೋಂಕಿನ ವಿರುದ್ಧದ ಯುದ್ಧದಲ್ಲಿ ಪ್ರತಿಯೊಬ್ಬರು ಕೈ ಜೋಡಿಸಬೇಕು. | kannad |
Opinion: ಜೈವಿಕ ಯುದ್ಧದ ತಯಾರಿಗೆ ಬಂತಾ ಕೊರೊನಾ ವೈರಸ್? ಮೊದಲ ಬಾರಿ ಕಾಣಿಸಿಕೊಂಡ ನಂತರ, ಕೊರೊನಾ ವೈರಸ್ ನಾಲ್ಕು ಹಂತದವರೆಗೆ ಹಬ್ಬುತ್ತದೆ. ಆ ನಂತರ, ತಾನೇ ತಾನಾಗಿ ಕಡಿಮೆಯಾಗುತ್ತದೆ. ಇದನ್ನು ವಿಭಿನ್ನ ರೀತಿಯಲ್ಲಿ ಅಧ್ಯಯನ ಮಾಡಿದ ಟಿವಿ9 ನೆಟ್ವರ್ಕ್ನ ಮುಖ್ಯ ಕಾರ್ಯ ನಿರ್ವಾಹಕ ಅಧಿಕಾರಿ ಬರುಣ್ ದಾಸ್, ಆ ಮೂಲಕ ಒಂದು ಹೊಸ ಚರ್ಚೆಯನ್ನು ಹುಟ್ಟುಹಾಕಿದ್ದಾರೆ. ಕೊರೊನಾ ಕುರಿತಾಗಿ ಇಲ್ಲಿವರೆಗೆ ಬಂದ ಚರ್ಚೆಗಿಂತ ಭಿನ್ನವಾದ ವಾದವನ್ನು ಇಲ್ಲಿ ಬರುಣ್ ದಾಸ್ ಮಂಡಿಸಿದ್ದಾರೆ. ಹಾಗಾಗಿ ಈ ಲೇಖನ ಬರೀ ಕುತೂಹಲ ಹುಟ್ಟಿಸುವುದೊಂದೇ ಅಲ್ಲ, ಒಂದು ಹೊಸ ಚರ್ಚೆಯನ್ನೇ ಹುಟ್ಟುಹಾಕುತ್ತಿದೆ. ಬರುಣ್ ದಾಸ್ ಟಿವಿ9 ನೆಟ್ವರ್ಕ್ನ ಮುಖ್ಯ ಕಾರ್ಯನಿರ್ವಾಹಕ ಅಧಿಕಾರಿಯಾಗಿ ಕೆಲಸ ನಿರ್ವಹಿಸುತ್ತಿದ್ದಾರೆ. ಸಂಶೋಧನಾ ಊಹೆ hypothesis ಮಾಡುವುದು ಎಂದರೇನು?ಕೋವಿಡ್ ಕುರಿತ ಎಲ್ಲಾ ಲೇಟೆಸ್ಟ್ ಅಪ್ಡೇಟ್ಸ್ ಓದಿ ಸಂಶೋಧನೆಯ ಆರಂಭಿಕ ಹಂತದ ಭಾಗವಾಗಿ ಸೀಮಿತ ಸಾಕ್ಷ್ಯಗಳ ಆಧಾರದ ಮೇಲೆ ಮಾಡಿದ ಊಹೆ ಅಥವಾ ಪ್ರಸ್ತಾವಿತ ವಿವರಣೆಯೇ ಸಂಶೋಧನಾ ಊಹೆ hypothesis ಎಂದು ಹೇಳಿದರೆ ತಪ್ಪಾಗಲಿಕ್ಕಿಲ್ಲ. ಒಂದು ಅಂಶವನ್ನು ನಿರ್ಣಾಯಕವಾಗಿ ಸಾಬೀತುಪಡಿಸಲು ಯಾವುದೇ ಸಿದ್ಧಾಂತ ಅಥವಾ ನಿಯಮದ ಅನುಪಸ್ಥಿತಿಯಲ್ಲಿ, ಸಂಶೋಧಕರು, ಸಂಶೋಧನಾ ಊಹೆ hypothesisಯನ್ನು ಬಳಸುತ್ತಾರೆ. ಅತಿದೊಡ್ಡ ನೈಸರ್ಗಿಕ ವಿಪತ್ತು ತಂದೊಡ್ಡಿರುವ ಕೋವಿಡ್ 19ರ ಮೂಲ ಮತ್ತು ಇನ್ನತರೆ ಸ್ವಭಾವ ಸಂಶೋಧಕರಿಗೆ ಅತಿದೊಡ್ಡ ಒಗಟಾಗಿದೆ. ಏತನ್ಮಧ್ಯೆ, ಪ್ರಪಂಚದಲ್ಲಿ ಲಕ್ಷಾಂತರ ಜನ ಮರಣ ಹೊಂದಿದ್ದಾರೆ. ಉದ್ಯೋಗ ನಷ್ಟ, ಆರ್ಥಿಕ ವಿನಾಶ ಮತ್ತು ಮಾನವಕುಲದ ವಿರಳತೆಯ ಅನಿಶ್ಚಿತತೆಯನ್ನು ಈ ಕೊವಿಡ್ ತೊಂದೊಡ್ಡಿದೆ. SARSCoV2, ಅಥವಾ ಕೊರೊನಾ ವೈರಸ್ನ ನೈಜ ಸ್ವರೂಪವನ್ನು ಕಂಡುಹಿಡಿಯುವ ಹೋರಾಟ ಮುಂದುವರೆದಿದೆ. ಅದು ಹೇಗೆ ಬರುತ್ತದೆ? ಅದು ಏಕೆ ಬರುತ್ತದೆ? ಯಾವಾಗ ಬರುತ್ತದೆ? ಮತ್ತು ಯಾವಾಗ ಮತ್ತು ಏಕೆ ಹೋಗುತ್ತದೆ ಎಂದು ಯಾರಿಗೂ ತಿಳಿದಿಲ್ಲ. ಒಂದು ನೈಸರ್ಗಿಕ ವಿದ್ಯಮಾನ ಮತ್ತು ಊಹೆಗೆ ನಿಲುಕದ random ನಡವಳಿಕೆಯಿಂದ ವೈರಸ್ ಅಪರೂಪವಾಗಿದ್ದರೆ, ಇದೀಗ ವಿಶ್ವದ ಪ್ರಖ್ಯಾತ ವಿಜ್ಞಾನಿಗಳು ಮತ್ತು ತಜ್ಞರು ಅದರ ಊಹೆಗೆ ನಿಲುಕದ random ನಡುವಳಿಕೆಯನ್ನು ಅಭ್ಯಸಿಸಲು ಒಂದು ವಿಧಾನವನ್ನು ಕಂಡುಹಿಡಿದಿರಬೇಕಾಗಿತ್ತು. ಈ ಊಹೆಗೆ ನಿಲುಕದ random ನಡುವಳಿಕೆಗೆ ಒಂದು ಮಾದರಿ ಇರುತ್ತಿತ್ತು. ಆದಾಗ್ಯೂ, ವಾಸ್ತವವೆಂದರೆ, ವೈರಸ್ನ ವಿಲಕ್ಷಣ ನಡವಳಿಕೆಯನ್ನು ಅರ್ಥಮಾಡಿಕೊಳ್ಳಲು ಜಗತ್ತು ವಿಫಲವಾಗಿದೆ. ಆದ್ದರಿಂದ, ಕೊರೊನಾ ವೈರಸ್ಗೆ ಒಂದು ವಿನ್ಯಾಸ ಅಥವಾ ಬುದ್ಧಿವಂತಿಕೆಯ ನಡುವಳಿಕೆ ಇದೆಯಾ ಎಂಬುದರ ಬಗ್ಗೆ ಬಹಳ ಊಹಾಪೋಹ ಇದೆ. ಸಂಗ್ರಹವಾಗಿದ್ದ ಲ್ಯಾಬ್ನಿಂದ ವೈರಸ್ ಸೋರಿಕೆಯಾದ ಕಾರಣ ಅದು ಜಗತ್ತಿನಲ್ಲೆಲ್ಲಾ ವ್ಯಾಪಿಸಿದೆ ಮತ್ತು ಈಗ ಅದನ್ನು ಬಳಸಲಾಗುತ್ತಿದೆ ಎಂಬ ವಿಚಾರ ಊಹೆಯನ್ನು ಇನ್ನಷ್ಟು ಬಲಗೊಳಿಸಿದೆ. ಭಾರತದಲ್ಲಿ ಬಂದ ಮೊದಲ ಕೊರೊನಾ ಅಲೆ 2020 ರ ಸೆಪ್ಟೆಂಬರ್ 16 ರಂದು ಉತ್ತುಂಗಕ್ಕೇರಿತು. ಪ್ರತಿ ದಿನದ ಹೊಸ ಸೋಂಕಿನ ಸಂಖ್ಯೆ 98,000 ಅನ್ನು ಮುಟ್ಟಿತು. ಅದರ ಮರುದಿನದಿಂದ ಸೋಂಕಿನ ಸಂಖ್ಯೆ ಕಡಿಮೆ ಆಗಲಾರಂಭಿಸಿತು. ವಿಶೇಷವೇನೆಂದರೆ, ಇದು ಒಮ್ಮಿಂದೊಮ್ಮೆ ಆದ ಕುಸಿತವಾಗಿತ್ತು. ಇದಕ್ಕೆ ಯಾವುದೇ ಸಮರ್ಥ ತಾರ್ಕಿಕ ವಿವರಣೆ ಸಿಗಲಿಲ್ಲ. ನೆನಪಿಡಿ, ಆ ಸಮಯದಲ್ಲಿ ಯಾವುದೇ ಲಾಕ್ ಡೌನ್ ಇರಲಿಲ್ಲ. ದೈನಂದಿನ ಸೋಂಕುಗಳ ಸಂಖ್ಯೆಯಲ್ಲಿನ ಇಳಿತಕ್ಕೆ ಕಾರಣವೇನು ಎಂದು ನಮಗೆ ಗೊತ್ತಾಗಿದ್ದರೆ, ಅದನ್ನು ಎರಡನೇ ಅಲೆಯ ಸಂದರ್ಭದಲ್ಲಿ ಮತ್ತು ಈಗ ಭಯಭೀತರಾಗಿರುವ ಮೂರನೇ ತರಂಗದ ಸಮಯದಲ್ಲಿ ಅದನ್ನು ಕಾರ್ಯರೂಪಕ್ಕೆ ತರಬಹುದಿತ್ತು. ಉತ್ಸವಗಳು ಮತ್ತು ಚುನಾವಣೆಗಳು ಇದ್ದರೂ ಸೋಂಕಿನ ಪ್ರಮಾಣ ತೀವ್ರವಾಗಿ ಕುಸಿದಿತ್ತು. ದುರ್ಗಾ ಪೂಜೆ 2226 ಅಕ್ಟೋಬರ್, ಬಿಹಾರ ವಿಧಾನಸಭಾ ಚುನಾವಣೆ ವೇಳಾಪಟ್ಟಿಯನ್ನು ಸೆಪ್ಟೆಂಬರ್ 25 ರಂದು ಘೋಷಿಸಲಾಯಿತು, ಮೂರರಲ್ಲಿ ಮತದಾನ ನಡೆಯಿತು ಹಂತಗಳು ಅಕ್ಟೋಬರ್ 28, 3 ನವೆಂಬರ್ ಮತ್ತು 7 ನವೆಂಬರ್, ದೀಪಾವಳಿ 14 ನವೆಂಬರ್, ಕ್ರಿಸ್ಮಸ್ ಡಿಸೆಂಬರ್ 25ನ್ನು ಆಚರಿಸಲಾಯ್ತು. ಈ ಸಂದರ್ಭದಲ್ಲಿ ಸೋಂಕಿನ ಪ್ರಮಾಣ ಕೆಳಗಿಳಿಯುತ್ತಲೇ ಇತ್ತು. ಸೋಂಕಿನ ಏರಿಳಿತವನ್ನು ಗಮನಿಸಿದರೆ, ಎರಡನೇ ಅಲೆಯಲ್ಲಿ ಇದರ ಪುನರಾವರ್ತನೆಯನ್ನು ಗಮನಿಸಬಹುದು. ಮೇ 6, 2021 ರಂದು ಸೋಂಕಿತರ ಸಂಖ್ಯೆ 4.14 ಲಕ್ಷ ತಲುಪಿತು. ಅದಾದ ನಂತರ, ಸೋಂಕಿನ ಪ್ರಮಾಣದಲ್ಲಿ ಇಳಿತ ಕಂಡಿತು. ಲಾಕ್ಡೌನ್ನಿಂದಾಗಿ ಈ ಕುಸಿತ ಆಯ್ತು ಅಂತ ಕೆಲವರು ಹೇಳಬಹುದು. ಆದರೆ ಲಾಕ್ಡೌನ್ ಇಲ್ಲದಿದ್ದಾಗ, ಮೊದಲ ಅಲೆಯ ಸಂದರ್ಭದಲ್ಲಿ ಆದ ಕುಸಿತವನ್ನು ಹೇಗೆ ವಿವರಿಸುತ್ತಾರೆ? ಗುಂಪು ರೋಗ ಪ್ರತಿನಿರೋಧಕ ಸಿದ್ಧಾಂತವು herd immunity theory ಇಲ್ಲಿ ಅನ್ವಯಿಸುವುದಿಲ್ಲ ಏಕೆಂದರೆ ಗಮನಾರ್ಹ ಪ್ರಮಾಣದ ಶೇಕಡಾವಾರು ಜನಸಂಖ್ಯೆ 70 ಅಥವಾ ಅದಕ್ಕಿಂತ ಹೆಚ್ಚು ಸೋಂಕಿಗೆ ಒಡ್ಡಿಕೊಂಡಾಗ ಮಾತ್ರ ಗುಂಪು ರೋಗ ಪ್ರತಿನಿರೋಧಕ ಹುಟ್ಟುತ್ತದೆ. ಈಗ ನಾನು ಈ ಲೇಖನದ ಮೂಲಕ ವಾದಿಸುವುದೇನೆಂದರೆ ಸಂಶೋಧನಾ ಊಹೆಯಿಂದ ಮಾತ್ರ ಇದನ್ನು ವಿವರಿಸಬಹುದು ಎಂಬುದು ನನ್ನ ದೃಢವಾದ ನಂಬಿಕೆ. ವೈರಸ್ನ್ನು ಕ್ಷೀಣಿಸುವ ಸಾಮರ್ಥ್ಯ ಸೋಂಕಿನ ಸಂಖ್ಯೆ, ಯಾರಿಗೆ ಬಂದಿತ್ತು ಎಂಬುದನ್ನು ನೋಡಿದಾಗ ಮತ್ತು ಈ ಕುರಿತು ಸೀಮಿತ ಸಂಶೋಧನೆಯು ಎರಡನೇ ಅಲೆಯ ಪ್ರಾರಂಭದಲ್ಲಿ ಆಗಿತ್ತು. ಕುಟುಂಬದ ಒಬ್ಬ ಸದಸ್ಯನು ವೈರಸ್ಗೆ ತುತ್ತಾದರೆ, ಕುಟುಂಬದ ಪ್ರತಿಯೊಬ್ಬರೂ ಸೋಂಕಿಗೆ ಒಳಗಾಗುತ್ತಾರೆ ಎಂಬ ವರದಿಗಳು ಎಲ್ಲ ಕಡೆಯಿಂದ ಬಂದಿತ್ತು. ಆದರೆ ಎರಡನೇ ಅಲೆ ಕ್ಷೀಣಿಸಲು ಪ್ರಾರಂಭಿಸಿದಾಗ ಅಂದರೆ, ಮೇ 34 ನೇ ವಾರದಿಂದ, ಸೋಂಕಿನ ಪ್ರವೃತ್ತಿ ಬದಲಾಯಿತು. ಈ ಅವಧಿಯಲ್ಲಿ, ಕುಟುಂಬದ ಓರ್ವ ಸದಸ್ಯ ಸೋಂಕಿಗೆ ಒಳಗಾಗಿದ್ದರೆ, ಕುಟುಂಬದ ಉಳಿದವರೆಲ್ಲರೂ ವೈರಸ್ಗೆ ತುತ್ತಾಗಲಿಲ್ಲ. ಇದೊಂದು ಕುತೂಹಲಕಾರಿ ಅಂಶ. ವೈರಸ್ ಕಡಿಮೆಯಾಗುವ ಸಾಮರ್ಥ್ಯದ ಗತಿಯನ್ನು ಪರಿಗಣಿಸಿದರೆ ಇದನ್ನು ವಿವರಿಸಬಹುದು. ಅದು ಪ್ರಾಥಮಿಕ ಸಂಪರ್ಕದಿಂದ ದ್ವಿತೀಯ ಹಂತದ ಸಂಪರ್ಕದ ವ್ಯಕ್ತಿ ಮತ್ತು ಆ ನಂತರ ದ್ವಿತೀಯ ಹಂತದ ಸೋಂಕಿತನಿಗೆ ಹರಡುತ್ತದೆ. ವೈರಸ್ನ್ನು ತೃತೀಯ ಹಂತದಲ್ಲಿ ರವಾನಿಸಿದಾಗ, ವೈರಸ್ನ ಸಾಮರ್ಥ್ಯವು ಕಡಿಮೆಯಾಗುತ್ತಲೇ ಇರುತ್ತದೆ. ಆದ್ದರಿಂದ, ಬಹುಶಃ ತೃತೀಯ ಹಂತದ ಸಂಪರ್ಕಕ್ಕೆ ಬಂದವರು ಈ ಸೋಂಕನ್ನು ಸ್ವೀಕರಿಸಿ ಅದನ್ನು 4 ನೇ ಹಂತದಲ್ಲಿ ಸಂಪರ್ಕಕ್ಕೆ ಬಂದವನಿಗೆ ದಾಟಿಸಿದಾಗ, ಈ ವೈರಸ್, ತನ್ನ ರೋಗವನ್ನು ಇನ್ನೊಬ್ಬ ವ್ಯಕ್ತಿಗೆ ಹರಡುವ ಸಾಮರ್ಥ್ಯವನ್ನು ಕಳೆದುಕೊಂಡಿದೆ. ಹೀಗಾಗಿ, ವೈರಸ್ ಪ್ರಾಥಮಿಕ, ದ್ವಿತೀಯಕ, ತೃತೀಯ ಸಂಪರ್ಕಕ್ಕೆ ವರ್ಗಾವಣೆಯಾಗುವುದರಿಂದ ಅದರ ಶಕ್ತಿಯನ್ನು ಕಳೆದುಕೊಳ್ಳುತ್ತದೆ ಎಂಬುದು ಸಂಶೋಧನಾ ಊಹೆ hypothesisಯಾಗಿದೆ. ಡೇಟಾವನ್ನು ವ್ಯಾಪಕವಾಗಿ ಸಂಗ್ರಹಿಸಿ ಅಧಿಕಾರಿಗಳಿಂದ ವಿಶ್ಲೇಷಿಸಿದ್ದರೆ, ಈ ಸಂಶೋಧನಾ ಊಹೆ hypothesisದೃಢವಾಗುತ್ತದೆ ಎಂದು ನನಗೆ ಖಾತ್ರಿಯಿದೆ. ಏಕೆಂದರೆ ಡೇಟಾ ಸುಳ್ಳಾಗುವುದಿಲ್ಲ. ಮತ್ತು ಈ ಸಂಶೋಧನಾ ಊಹೆ hypothesisಯಲ್ಲಿ ಅರ್ಹತೆ ಇದ್ದರೆ, ದೈನಂದಿನ ಸೋಂಕಿನ ಇಳಿತಕ್ಕೆ ಕಾರಣ: ಮಾನವನಿಂದ ಮನುಷ್ಯನಿಗೆ ತಲುಪಿದ ನಂತರ, ವೈರಸ್ ತನ್ನ ಶಕ್ತಿಯನ್ನು ಕಳೆದುಕೊಳ್ಳುತ್ತದೆ ಮತ್ತು ಆದ್ದರಿಂದ ಕೆಲವು ಹಂತದ ಪ್ರಸರಣದ ನಂತರ ಅದು ಸಾಂಕ್ರಾಮಿಕವಾಗುವುದನ್ನು ನಿಲ್ಲಿಸುತ್ತದೆ ಎಂದು ನಿಸ್ಸಂದೇಹವಾಗಿ ವಿವರಿಸಲಾಗಿದೆ. ಈಗ ಸಂಶೋಧನಾ ಊಹೆ hypothesis ಸರಿಯಾಗಿದ್ದರೆ ಮತ್ತು ನೀವು ಅದನ್ನು ಆರ್ನಾಟ್ ಗಣಿತದೊಂದಿಗೆ ಹೋಲಿಸಿ ಲೆಕ್ಕಾಚಾರ ಮಾಡಿದರೆ, ಕೋವಿಡ್ 19 ನೈಸರ್ಗಿಕ ವಿಪತ್ತಿಗಿಂತ ಹೆಚ್ಚಿನದಾಗಿದೆ ಎಂಬ ಅನಿವಾರ್ಯ ತೀರ್ಮಾನಕ್ಕೆ ಬರುತ್ತೀರಿ. ವಾಸ್ತವವಾಗಿ, ನೀವು ಜೈವಿಕ ದಾಳಿಯ ಸಾಧ್ಯತೆಯತ್ತ ವಾಲಬಹುದು. ಹಾಗಾದರೆ ಅಂತಹ ವಿಪರೀತ ಸಾಧ್ಯತೆಯನ್ನು ಪರಿಗಣಿಸಲು ನಮ್ಮನ್ನು ಒತ್ತಾಯಿಸುವ ಈ ಗಣಿತ ಯಾವುದು? ಸೋಂಕನ್ನು ನಿರ್ದಿಷ್ಟ ಸಂಖ್ಯೆಯ ಜನರಿಗೆ ವರ್ಗಾಯಿಸುವ ವೈರಸ್ ಸಾಮರ್ಥ್ಯವನ್ನು ಡೇಟಾ ಪರಿಭಾಷೆಯಲ್ಲಿ ಆರ್ನಾಟ್ ಎಂದು ಕರೆಯಲಾಗುತ್ತದೆ. ಕೊರೊನಾ ವೈರಸ್ ಆರ್ನಾಟ್ 5 ಎಂದು ಸಂಶೋಧನೆ ಅಂದಾಜಿಸಿದೆ. ಇದರರ್ಥ ಕೋವಿಡ್ ಧನಾತ್ಮಕ ವ್ಯಕ್ತಿಯು ಇನ್ನೂ ಐದು ಜನರಿಗೆ ಸೋಂಕು ತಗುಲಿಸಬಹುದು. ಆದ್ದರಿಂದ, ಐದು ಪ್ರಾಥಮಿಕ ಸೋಂಕುಗಳಿದ್ದರೆ, 25 ದ್ವಿತೀಯಕ ಸೋಂಕುಗಳು ಕಂಡುಬರುತ್ತವೆ. ವೈರಸ್ ಇನ್ನೂ ಮುಂದಿನ ಹಂತಗಳಿಗೆ ಹರಡಲು ಸಾಕಷ್ಟು ಪ್ರಬಲವಾಗಿದೆ ಎಂದು ನಾವು ಪರಿಗಣಿಸಿದರೂ, 3 ಮತ್ತು 4 ನೇ ಹಂತದಲ್ಲಿ ಸೋಂಕು ಮುಂದುವರಿಯುವುದರಿಂದ, ಇದು ಗರಿಷ್ಠ 625 ಜನರಿಗೆ ಸೋಂಕು ತಗುಲಿಸುತ್ತದೆ. ಅವರಲ್ಲಿ 600 ಮಂದಿ ದುರ್ಬಲ, ತೃತೀಯ ಮತ್ತು 4 ನೇ ಹಂತದ ಸೋಂಕಿತರು ಎಂದು ಪರಿಗಣಿಸಬಹುದು. ಆದ್ದರಿಂದ, ಸೋಂಕು ತೀವ್ರವಾಗಿ ಇಳಿಯುವ ಮೊದಲು 10 ಮಿಲಿಯನ್ ಒಂದು ಕೋಟಿ ಜನರು ಹೇಗೆ ಸೋಂಕಿಗೆ ಒಳಗಾಗುತ್ತಾರೆ ಎಂಬುದು ಪ್ರಶ್ನೆ. 4ನೇ ಹಂತದ ನಂತರ, ವೈರಸ್ ತನ್ನ ಶಕ್ತಿಯನ್ನು ಕಳೆದುಕೊಳ್ಳುತ್ತಿದ್ದರೆ, ಎರಡನೇ ಅಲೆಯಲ್ಲಿ ಒಟ್ಟು 10 ಮಿಲಿಯನ್ ಜನರನ್ನು 4 ನೇ ಹಂತದಲ್ಲಿ ತಲುಪಲು ಅದು ಕನಿಷ್ಠ ಒಂದು ಲಕ್ಷ ಒಂದು ಲಕ್ಷ ಪ್ರಾಥಮಿಕ ಸೋಂಕುಗಳೊಂದಿಗೆ ಪ್ರಾರಂಭವಾಗಿರಬೇಕು. ಆಗ ಮಾತ್ರ, 5 ರ ಆರ್ನಾಟ್ನೊಂದಿಗೆ, ವೈರಸ್ ಹರಡುವಿಕೆಯ ಸಾಮರ್ಥ್ಯವನ್ನು ಕಳೆದುಕೊಳ್ಳುವ ಮೊದಲು 4 ನೇ ಹಂತದಲ್ಲಿ ಸುಮಾರು 10 ಮಿಲಿಯನ್ ಜನರು ಸೋಂಕಿಗೆ ಒಳಗಾಗುತ್ತಿದ್ದರು ಎಂದು ಅಂದಾಜಿಸಬಹುದು. ಆದ್ದರಿಂದ, ಒಂದು ಲಕ್ಷ ಪ್ರಾಥಮಿಕ ಸಂಪರ್ಕದಲ್ಲಿರುವ ವ್ಯಕ್ತಿಗಳು ಇಲ್ಲದಿದ್ದರೆ, ಈ ವೈರಸ್ ಅದು ಊಹೆ ಮಾಡಿದಷ್ಟು ಹರಡುವುದಿಲ್ಲ. ವಿಮಾನಗಳ ಮೂಲಕ ವಿದೇಶದಿಂದ ಸೋಂಕನ್ನು ತರುವ ಕೆಲವು ಜನರು ಅಂತಹ ವಿನಾಶಕಾರಿ ಹರಡುವಿಕೆಯನ್ನು ಪ್ರಚೋದಿಸಲಾರರು. ಒಂದೊಮ್ಮೆ ವಿಮಾನದಲ್ಲಿದ್ದ ಎಲ್ಲಾ ಪ್ರಯಾಣಿಕರು ವೈರಸ್ನೊಂದಿಗೆ ಬಂದಿದ್ದರೆ, ಒಂದು ಲಕ್ಷ ಜನರು ಪ್ರಾಥಮಿಕ ಹಂತದ ಸೋಂಕಿಗೆ ಹೇಗೆ ಒಳಗಾಗುತ್ತಿದ್ದರು. ಹಾಗಾದರೆ, ಪ್ರಾಥಮಿಕವಾಗಿ ಹರಡುವವರ ಇಷ್ಟು ದೊಡ್ಡ ಸಂಖ್ಯೆ ಹೇಗೆ ಬಂತು? ಭಾರತಕ್ಕೆ ಬಂದ ಕೆಲವು ಸರಕು ಮತ್ತು ವಸ್ತುಗಳು ಸೋಂಕನ್ನು ತಂದಿವೆಯೇ? ಮೊದಲ ಅಲೆಯ ಸಮಯದಲ್ಲಿ, ಇಟಲಿಯಲ್ಲಿ ಸೋಂಕುಗಳ ಸ್ಫೋಟ ಸಂಭವಿಸಿದಾಗ, ಇದು ನೇರವಾಗಿ ವೈರಸ್ನ ಮೂಲವಾದ ವುಹಾನ್ನಿಂದ ಇಟಾಲಿಯನ್ ಫ್ಯಾಷನ್ ಉದ್ಯಮಕ್ಕೆಂದು ತಂದ ಚರ್ಮದ ಮೂಲಕ ಬಂದಿತ್ತು ಎಂಬ ವಿಚಾರ ಕೂಡ ಇದೆ. ಇಟಲಿ ಮಾತ್ರವಲ್ಲ, ಮೊದಲ ಮತ್ತು ಎರಡನೆಯ ಅಲೆಗಳಲ್ಲಿ, ಸೋಂಕಿನ ಸ್ಫೋಟಕ್ಕೆ ಸಾಕ್ಷಿಯಾದ ಇತರ ದೇಶಗಳು ಕೂಡ ಈ ರೀತಿಯ ವಿಚಾರವನ್ನು ಚರ್ಚಿಸುತ್ತಿವೆ. ಪ್ರಾರಂಭವಾಗಿ ಐದು ಸುತ್ತು ದಾಟುವ ಹೊತ್ತಿಗೆ ತನ್ನ ತೀವ್ರತೆಯನ್ನು ಕಳೆದುಕೊಳ್ಳುವ ಈ ವೈರಸ್ನ ರೂಪಾಂತರ ಮತ್ತು ವಿಕಸನದ ರೂಪವನ್ನು ಗಮನಿಸಿದಾಗ, ಒಂದಂತೂ ನಿಶ್ಚಿತ. ಇದು ಹರಡಲು ಸಮಯ ತೆಗೆದುಕೊಳ್ಳುತ್ತಿದೆ. ಅವು ರಾತ್ರೋರಾತ್ರಿ ರೂಪಾಂತರಗೊಳ್ಳುವುದಿಲ್ಲ. ಮತ್ತು ಆ ವೇಗದಲ್ಲಿ ಸಂಭವಿಸುವುದಿಲ್ಲ. ಆರ್ನಾಟ್ನ ಪ್ರಾಯೋಗಿಕ ಊಹೆಯು ಸರಿಯಾಗಿದ್ದರೆ ಮತ್ತು ವೈರಸ್ ಪ್ರತಿ ಹಂತದ ಸೋಂಕಿನೊಂದಿಗೆ ಕಡಿಮೆಯಾಗುತ್ತಿದ್ದರೆ, ಅಲೆಗಳು ಮುಗ್ಧವಲ್ಲ. ಇದು ಫೌಲ್ ಪ್ಲೇ ಅಂದರೆ ನೈಸರ್ಗಿಕವಾಗಿದ್ದುದಲ್ಲಿ ಮತ್ತು ಯೋಚಿಸಲಾಗದ ಯೋಜಿತ ಜೈವಿಕ ದಾಳಿ ಇರಬಹುದು ಎಂಬುದನ್ನು ಸೂಚಿಸುತ್ತದೆ. ಈಗ, ಈ ಸಂಶೋಧನಾ ಊಹೆ hypothesis ಯಾವುದೇ ಅರ್ಥವನ್ನು ನೀಡುತ್ತದೆಯೆ ಅಥವಾ ಇಲ್ಲವೇ ಎಂಬುದನ್ನು ಕಂಡುಹಿಡಿಯುವುದು ಡೇಟಾ ವಿಜ್ಞಾನಿಗಳು, ಸರ್ಕಾರಗಳು, ವೈರಾಲಜಿಸ್ಟ್ಗಳು ಮತ್ತು ತಜ್ಞರಿಗೆ ಬಿಟ್ಟದ್ದು. ಎರಡನೇ ತರಂಗ ಇದ್ದಕ್ಕಿದ್ದಂತೆ ಸ್ಫೋಟಗೊಂಡಾಗ ಮಹಾರಾಷ್ಟ್ರ ಮತ್ತು ಕೇರಳದಲ್ಲಿ ಏನಾಯಿತು ಎಂದು ಕಂಡುಹಿಡಿಯಲು ಈ ಕಲಿತ ಜನರು ಕೆಲವು ತಿಂಗಳುಗಳ ಹಿಂದೆ ಹೋಗಿ ಡೇಟಾವನ್ನು ಪರಿಶೀಲಿಸಬೇಕಾಗಿದೆ. ವಿಮಾನಗಳು ಎಲ್ಲಿಂದ ಬಂದವು, ಪ್ರಯಾಣಿಕರು ಎಲ್ಲಿಂದ ಬಂದರು? ಆಮದು ಮಾಡಿದ ಸರಕುಗಳು ಎಲ್ಲಿಂದ ಹುಟ್ಟಿದವು? ಎಲ್ಲವನ್ನೂ ಪರಿಶೀಲಿಸಬೇಕು ಮತ್ತು ಪರಿಶೀಲಿಸಬೇಕು. ಆಗ ಮಾತ್ರ ಭಾರತ, ಅಥವಾ ಜಗತ್ತು ನಿಜವಾಗಿಯೂ ಕೊರೊನಾ ವೈರಸ್ನ ಒಗಟನ್ನು ಪರಿಹರಿಸುತ್ತದೆ. ದುರದೃಷ್ಟವಶಾತ್, ತಜ್ಞರು ಮತ್ತು ಸರ್ಕಾರಗಳು ಮಾಡುತ್ತಿರುವುದು ಅದಲ್ಲ. ಅದೇ ಸಮಯದಲ್ಲಿ ಕೆಲವು ಪಂಡಿತರು ಅಡ್ಡಿಪಡಿಸುವ ಮೂರನೇ ಅಲೆಯನ್ನು ನಿರ್ವಹಿಸುವುದು ಹೇಗೆ ಎಂಬುದರಲ್ಲಿ ನಿರತರಾಗಿದ್ದಾರೆ. ಮೂರನೇ ಅಲೆ ಬರಬಹುದು ಎಂದು ಬಹುತೇಕ ಜನರು ನಂಬಲು ಮುಂದಾಗುತ್ತಾರೆ. ಅದು ಬಂದಾಗ ನಾವು ನೋಡೋಣ. ನಾವು ಗಮನಹರಿಸುವ ಕೊನೆಯ ವಿಷಯವೆಂದರೆ ವೈರಸ್ನ ಮೂಲ ಮತ್ತು ಕಾರಣವನ್ನು ಅರ್ಥಮಾಡಿಕೊಳ್ಳುವ ಪ್ರಯತ್ನ. ನಾನು ಆಶ್ಚರ್ಯ ಪಡುವುದೇನೆಂದರೆ, ವೈರಸ್ ಬಗ್ಗೆ ನಮಗೆ ಅಷ್ಟು ಕಡಿಮೆ ತಿಳಿದಿದ್ದರೆ, ಮೂರನೆಯ ಅಲೆ ಬರುತ್ತಿದೆ ಎಂದು ನಾವು ಹೇಗೆ ಖಚಿತವಾಗಿ ಹೇಳುತ್ತೇವೆ? ಅದೂ ಕೂಡ ಯಾರೋ ಎಲ್ಲೋ ಕುಳಿತು ಇದನ್ನೆಲ್ಲಾ ಯೋಜಿಸಿದಂತೆ. ಇದನ್ನೂ ಓದಿ: Wuhan Lab ಚೀನಾ ವೈರಸ್ ವುಹಾನ್ ಲ್ಯಾಬ್ನಿಂದ ಬಂದದ್ದು ನಾನು ಅಂದು ಹೇಳಿದ್ದು ಸರಿ ಇದೆ ಅಲ್ಲವೇ?: ಡೊನಾಲ್ಡ್ ಟ್ರಂಪ್ Wuhan Lab ಕೊರೊನಾವೈರಸ್ ವುಹಾನ್ ಲ್ಯಾಬ್ನಿಂದ ಸೋರಿಕೆಯಾಗಿರಬಹುದು: ಅಮೆರಿಕ ವರದಿ Analysis TV9 network CEO Barun Das comes out with a new hypothesis on the origin and spread of SARS Covid19 | kannad |
تٔمۍ ووٚن یہِ کیٛاہ عجیبٕے | kashmiri |
ರಾಜ್ಯಗಳ ಆರ್ಥಿಕತೆಗೆ ಕೊಳ್ಳಿ ಇಟ್ಟ ಕೇಂದ್ರ HDK ಆಕ್ರೋಶ ಬೆಂಗಳೂರು: ಸುಲಭದ ಬಡ್ಡಿದರದಲ್ಲಿ ಸಾಲ ತೆಗೆದುಕೊಳ್ಳಿ ಪಡೆದ ಸಾಲವನ್ನು ರಾಜ್ಯಗಳೇ ತೀರಿಸಿ ಎನ್ನುವ ಆಯ್ಕೆ ಮುಂದಿಟ್ಟು ಕೇಂದ್ರ ಸರ್ಕಾರ ರಾಜ್ಯಗಳ ಆರ್ಥಿಕತೆಗೆ ಕೊಳ್ಳಿ ಇಟ್ಟಿದೆ ಎಂದು ಮಾಜಿ ಮುಖ್ಯಮಂತ್ರಿ ಕುಮಾರಸ್ವಾಮಿ ಕಿಡಿಕಾರಿದ್ದಾರೆ. ಈ ಬಗ್ಗೆ ಸರಣಿ ಟ್ವೀಟ್ ಮಾಡಿರುವ ಕುಮಾರ ಸ್ವಾಮಿ ಸರಕು ಮತ್ತು ಸೇವಾ ತೆರಿಗೆ ಜಿ ಎಸ್ ಟಿ ನಷ್ಟ ತುಂಬಿಕೊಡುವ ಬದ್ಧತೆಯಿಂದ ಹಿಂದೆ ಸರಿದಿರುವ ಕೇಂದ್ರ ಸರ್ಕಾರ, ರಾಜ್ಯ ಸರ್ಕಾರಗಳ ಮೇಲೆ ಗದಾಪ್ರಹಾರ ಮಾಡುವ ಮೂಲಕ ಹೊಣೆಗೇಡಿತನ ಪ್ರದರ್ಶಿಸಿರುವುದು ತೀವ್ರ ಖಂಡನೀಯ. ಕೊರೊನಾ ಸಂಕಷ್ಟ ದೇವರ ಅಸಮಾನ್ಯ ಆಟ ಎನ್ನುವ ಮೂಲಕ ಒಕ್ಕೂಟ ವ್ಯವಸ್ಥೆಯ ರಾಜ್ಯಗಳ ಬಹುದೊಡ್ಡ ನಂಬಿಕೆಗೆ ಕೊಡಲಿಪೆಟ್ಟು ಕೊಟ್ಟಿದೆ. ಸುಲಭದ ಬಡ್ಡಿದರದಲ್ಲಿ ಸಾಲ ತೆಗೆದುಕೊಳ್ಳಿ ಪಡೆದ ಸಾಲವನ್ನು ರಾಜ್ಯಗಳೇ ತೀರಿಸಿ ಎನ್ನುವ ಆಯ್ಕೆ ಮುಂದಿಟ್ಟು ರಾಜ್ಯಗಳ ಆರ್ಥಿಕತೆಗೆ ಕೇಂದ್ರ ಸರ್ಕಾರ ಕೊಳ್ಳಿ ಇಟ್ಟಿದೆ. NewsFirst Live ಯಾವುದೇ ಪ್ರಲೋಭನೆ ಒಡ್ಡುವ ಮೂಲಕ ರಾಜ್ಯಗಳ ಆರ್ಥಿಕತೆಯ ವ್ಯವಸ್ಥೆ ಮೇಲೆ ನಿಯಂತ್ರಣ ಸಾಧಿಸುವ ಕಾನೂನು, ತಿದ್ದುಪಡಿ ಮಸೂದೆಗಳು ಭವಿಷ್ಯದಲ್ಲಿ ಒಕ್ಕೂಟ ವ್ಯವಸ್ಥೆಯನ್ನು ಶಿಥಿಲಗೊಳಿಸುವ ಅಪಾಯ ಇಲ್ಲದಿಲ್ಲ ಎಂದು ಸಂವಿಧಾನ ಶಿಲ್ಪಿ ಡಾ. ಬಿ.ಆರ್. ಅಂಬೇಡ್ಕರ್ ಪ್ರತಿಪಾದಿಸಿದ್ದರು. ಇಂತಹದೊಂದು ಅಪಾಯ ಈಗ ಎದುರಾಗಿದೆ, ಈಗ ಸಂಗ್ರಹವಾಗಿರುವ ತೆರಿಗೆಯಲ್ಲಿ ರಾಜ್ಯ ಸರ್ಕಾರಗಳಿಗೆ ಪರಿಹಾರ ನೀಡಲು 97 ಸಾವಿರ ಕೋಟಿ ರೂ ಹಾಗೂ ಆದಾಯ ಕೊರತೆ ಎದುರಾಗಲಿರುವ 2.35 ಲಕ್ಷ ಕೋಟಿ ರೂಪಾಯಿಗಳನ್ನು ರಾಜ್ಯಗಳು ಸಾಲ ಪಡೆಯುವ ಆಯ್ಕೆಗಳನ್ನು ಮುಂದಿಟ್ಟಿದೆ. ಕೊಟ್ಟವ ಕೋಡಂಗಿ ಇಸ್ಕೊಂಡವ ಈರಭದ್ರ ಎಂಬಂತೆ ರಾಜ್ಯ ಸರ್ಕಾರಗಳು ಕಣ್ಣುಬಾಯಿ ಬಿಡುತ್ತಿವೆ, ಈಗ ಕೊರೊನಾ ನೆಪ ಮುಂದಿಟ್ಟು ಅನ್ಯಾಯ ಮಾಡಿಬಿಟ್ಟರೆ ರಾಜ್ಯಸರ್ಕಾರಗಳು ಏನು ಮಾಡಬೇಕು? ಕೊರೊನಾ ಮತ್ತು ನೆರೆಯಿಂದ ಬಳಲಿರುವ ರಾಜ್ಯ ಸರ್ಕಾರಗಳು ಕೇಂದ್ರ ಸರ್ಕಾರಕ್ಕೆ ಹಿಡಿಶಾಪ ಹಾಕುತ್ತಿವೆ. ತಾಳ ತಪ್ಪಿದ ಕೇಂದ್ರಸರ್ಕಾರದ ದಿಕ್ಕೆಟ್ಟ ಅರ್ಥವ್ಯವಸ್ಥೆ ಮತ್ತು ಮುನ್ನೋಟದ ಅಂದಾಜು ಗ್ರಹಿಸದ ವೈಫಲ್ಯದ ಫಲವಾಗಿ ರಾಜ್ಯ ಸರ್ಕಾರಗಳು ಹಗ್ಗ ಕೊಟ್ಟು ಕೈ ಕಟ್ಟಿಸಿಕೊಂಡ ಪರಿಸ್ಥಿತಿಗೆ ಸಿಲುಕಿ ನಲುಗುತ್ತಿವೆ. ರಾಜ್ಯಗಳಿಗೆ ಸಾಲ ಕೊಡಿಸುವ ಬದಲು ಕೇಂದ್ರವೇ RBIನಿಂದ ಸಾಲ ಪಡೆದು ರಾಜ್ಯಗಳಿಗೆ ನಷ್ಟ ಪರಿಹಾರ ತುಂಬಿ ಕೊಡಲಿ ಎಂದಿದ್ದಾರೆ. ಅಷ್ಟಮಿ ನವಮಿ ಎಂಬ ಕಲ್ಪಿತವೇಕೋ ಶರಣಂಗೆ ತಪ್ಪಿತ್ತು ಗಣಪದವಿ, ಲಿಂಗಕ್ಕೆ ದೂರ ಒಬ್ಬರಿಗಾಳಾಗಿ, ಒಬ್ಬರನೋಲೈಸುವ ನಿರ್ಬುದ್ಧಿ ಮನುಜರನೇನೆಂಬೆ, ಕೂಡಲಸಂಗಮದೇವಾ! ಎಂಬ ಬಸವಣ್ಣನ ವಚನ ಬಳಸಿಕೊಂಡು ಟ್ವೀಟ್ ಮಾಡಿದ್ದಾರೆ. | kannad |
Expanding the world of possibility for aging.
Recognizes a member community that has advanced public trust and confidence in aging services through public service, collaboration, media or other efforts to educate consumers and help them make informed choices.
Recognizes a member community that demonstrates investment in their staff and workplace environment for the delivery of quality care and services; demonstrates innovation in workforce development practices.
Vision - Respect the past. Lead today. Create the future.
Award of honor that recognizes an individual who has made an outstanding contribution to aging services and/or to the association through inspirational leadership and vision throughout their career, has a distinguished record of service in nonprofit leadership and dedication in achieving their community's specific goals and objectives.
Recognizes an early-career leader who makes a unique contribution to the field in areas of service, administration, or education; demonstrates passion, dedication, and commitment to understanding and applying leadership concepts and values; demonstrates making a different in the community with qualitative results in improving services; committed to professional development through active involvement within other professional or community organizations and/or LeadingAge Virginia.
Advocacy - Hear every voice. Be the voice for those we serve.
Recognizes an individual for exceptional achievement in advocacy initiatives that has advanced the nonprofit mission, expanding the possibilities for aging, and/or improved the legal, public, and/or regulatory environment influencing the provision of aging services; champions resident life enrichment and exceptional care delivery.
Recognizes a clinical or support staff member who provides outstanding commitment to the residents within their role in the community; either leads with or exhibits a person-centered approach of compassion to the individuals they serve or shows specific actions that enhance and enrich the lives of residents; goes above and beyond their role to consistently represent the community's mission, vision, and values. | english |
## INDICATION:
year old woman with hx R lung cancer // evaluation interval
change, esp effusions
## IMPRESSION:
In comparison to the prior radiograph of 1 day earlier, there has been further
opacification of the right hemi thorax, which is now nearly completely
opacified except for a small portion at the right base. This appears to
predominantly be due to an enlarging right pleural effusion combined with a
large mediastinal mass, which is been more fully evaluated by a recent CT.
Tracheostomy tube in bilateral bronchial stents remain in place. Exam is
otherwise remarkable for worsening left lower lobe opacity with adjacent small
pleural effusion. Known left lung nodules have been more fully evaluated by
CT.
| medical |
കരിപ്പൂര് സ്വര്ണ്ണക്കടത്ത് സംഘത്തിലെ ഒരാള്കൂടി അറസ്റ്റില് കരിപ്പൂര് സ്വര്ണക്കടത്തുമായി ബന്ധപ്പെട്ട് ഒരാള്കൂടി അറസ്റ്റില്. കൊടുവള്ളി സംഘത്തില്പെട്ട വട്ടോളി സ്വദേശി കോട്ടോപറമ്ബില് മുഹമ്മദ് റാഫി31യാണ് പിടിയിലായത്. രഹസ്യതാവളത്തില്നിന്ന് റാഫിയെ കൊണ്ടോട്ടി ഡിവൈഎസ്പി അഷ്റഫിന്റെ നേതൃത്വത്തിലുള്ള സംഘം അറസ്റ്റ് ചെയ്തത്. 16ഓളം വാഹനങ്ങളും പൊലീസ് പിടിച്ചെടുത്തിട്ടുണ്ട്. ഇതോടെ കേസില് അറസ്റ്റിലായ പ്രതികളുടെ എണ്ണം 34 ആയി. കരിപ്പൂര് വിമാനത്താവളം വഴി സ്വര്ണം കടത്തിയ കേസില് കൂടുതല് പ്രതികള് ഉള്പ്പെട്ടിട്ടുണ്ടെന്നാണ് കസ്റ്റംസിന്റെ കണ്ടത്തല്. കേസില് 17 പ്രതികളെ കൂടി അറസ്റ്റ് ചെയ്യാന് അനുമതി നല്കണമെന്ന് ആവശ്യപ്പെട്ട് കസ്റ്റംസ് നല്കിയ അപേക്ഷ കോടതി ഇന്ന് അംഗീകരിച്ചിരുന്നു.The post കരിപ്പൂര് സ്വര്ണ്ണക്കടത്ത് സംഘത്തിലെ ഒരാള്കൂടി അറസ്റ്റില് first appeared on MalayalamExpressOnline. | malyali |
SBI, સેન્ટ્રલ બેંક, રિઝર્વ બેંક, NMDC, NHPCમાં ભરતી રાજ્યમાં રોજગાર વાંચ્છુક ઉમેદવારોના લાભાર્થે ગુજરાત મિરર, સાંધ્ય દૈનિક દર શુક્રવારે રોજગાર માર્ગદર્શન નામનો એક લેખ લઈને આવે છે. જેમાં સરકારી,ખાનગી, મલ્ટીનેશનલ કંપનીઓ વગેરેમાં આવતી ભરતીઓ વિશે માહિતી આપવામાં આવે છે. આ અંકમા વિવિધ ભરતીઓ વિશે વિસ્તૃત માહિતી આપવામાં આવી છે. વડોદરા મહાનગર પાલિકામાં ભરતીટખઈ વડોદરા મહાનગરપાલિકામાં ખાલી તથા સંભવિત ઊભી થનાર જગ્યા પર રોસ્ટર ક્રમની નિભાવણીને આધિક લાયકાત ધરાવતા ઉમેદવારો પાસેથી ઓનલાઈન અરજીઓ મંગાવવામાં આવી છે. જેમાં વોર્ડ ઓફિસર4, રેવન્યુ ઓફિસર07, જુનિયર ક્લાર્ક552, સબ સેને. ઈન્સ્પેકટર 10,મલ્ટી પર્પઝ વર્કર 68 મળીને કુલ 641ની ભરતી જાહેર કરવામાં આવી છે. ફોર્મ ભરવાની છેલ્લી તારીખ: 28 ફેબ્રુઆરી 2022 શૈક્ષણિક લાયકાત: વિવિધ જગ્યાઓ ઉપર અલગ અલગ શૈક્ષણિક લાયકાતો માંગવામાં આવી છે. જેની વિસ્તૃત માહિતી ઓફિશિયલ વેબસાઈટ ૂૂૂ.દળભ.લજ્ઞદ.શક્ષ પર મળશેે. વય મર્યાદા: 35થી વધુ નહીં અનામત વર્ગના ઉમેદવારોને સરકારી નિયમ અનુસાર છૂટછાટ મળશે. એપ્લિકેશન ફી: જનરલ ઓબીસી, અન્ય રૂા.400 જઈજઝ, અન્ય રૂા.200રાજકોટ નાગરિક સહકારી બેંકમાં પ્યૂનની ભરતી રાજકોટ નાગરિક સહકારી બેન્કમાં પ્યૂનની 9 જગ્યા માટે ઓનલાઈન અરજીઓ મંગાવવામાં આવી છે. લાયકાત ધરાવતા ઉમેદવારો ઓનલાઈન અરજી કરી શકશે. અરજી કરવાની અંતિમ તારીખ: 23 ફેબ્રુઆરી2022 શૈક્ષણિક લાયકાત: સ્નાતક વયમર્યાદા: 30થી વધુ નહીં.નેશનલ મિનરલ ડેવલપમેન્ટ કોર્પોરેશનમાં વિવિધ ભરતી ગખઉઈ નેશનલ મિનરલ ડેવલપમેન્ટ કોર્પોરેશન લિમિટેડ ગખઉઈએ જુનિયર ઓફિસરની વિવિધ ભરતીઓ માટે ઓનલાઈન અરજીઓ મંગાવવામાં આવી છે. જેમાં સિવિલમાં જુનિયર ઓફિસર7, ઈલેક્ટ્રિક જુનિયર ઓફિસર14, મીકેનિકલમાં33, માઈનિંગમાં32, જી.એન.ક્યુસીમાં7, સર્વે ટ્રેનીની1 જગ્યા માટે ઓનલાઈન અરજીઓ મંગાવવામાં આવેલ છે. ફોર્મ ભરવાની છેલ્લી તારીખ: 27 ફેબ્રુઆરી 2022 શૈક્ષણિક લાયકાત: સંબંધિત વિષયમાં એમ.એસ.સી. કે એમ.ટેક ડિપ્લોમા, બી.ઈ.કે. બી.ટેક કર્યું હોવું જોઈએ. અલગ અલગ જગ્યાઓ માટે શૈક્ષણિક લાયકાતની વિસ્તૃત માહિતી માટે ઓફિશિયલ વેબસાઈટ ૂૂૂ.ક્ષળમભ.ભજ્ઞ.શક્ષ પર મળશે. વયમર્યાદા: વધુમાં વધુ 32 વર્ષ એપ્લિકેશન ફી: જનરલઓબીસી રૂા.250 જઈજઝઙઠઉ વગેરેએ ફી ભરવાની નથી. જઇઈંમાં સ્પેશિયાલિસ્ટ કેડર ઓફિસરની ભરતી સ્ટેટ બેન્ક ઓફ ઈન્ડિયાએ સ્પેશિયાલિસ્ટ કેડર ઓફિસરની 53 ખાલી જગ્યાની ભરતી માટે લાયકાત ધરાવતા ઉમેદવારો પાસેથી ઓનલાઈન અરજીઓ મંગાવવામાં આવેલ છે. ફોર્મ ભરવાની અંતિમ તારીખ: 25 ફેબ્રુઆરી 2022 શૈક્ષણિક લાયકા: માન્યતા પ્રાપ્ત યુનિવર્સિટીમાંથી ખઇઅ વિસ્તૃત માહિતી માટે ઓફિશિયલ વેબસાઈટ વિિંાંત:તબશ.ભજ્ઞ.શક્ષ પર મેળવી શકાશે વય મર્યાદા: ઉમેદવારની ઉંમર 30થી 40 વચ્ચે હોવી જોઈએ અનામત વર્ગના ઉમેદવારોને નિયમ અનુસાર વય મર્યાદામાં છૂટછાટ મળશે. એપ્લીકેશન ફી: જનરલઊઠજઘઇઈ ઉમેદવારોએ રૂા.750 જઈજઝઙઠઉ ઉમેદવારોએ ફી ભરવાની નથી. નેશનલ હાઈડ્રોઇલેક્ટ્રિક પાવર કોર્પોરેશનમાં જુ.એન્જિનિયરની ભરતી:ગઇંઙઈ નેશનલ હાઈડ્રોઈલેક્ટ્રિક પાવર કોર્પોરેશનની જુનિયર એન્જિનિયરની કુલ 133 જગ્યાની ભરતી માટે યોગ્ય ઉમેદવારો પાસેથી અરજીઓ મંગાવવામાં આવેલ છે. અરજી કરવાની અંતિમ તારીખ: 21 ફેબ્રુઆરી 2022 શૈક્ષણિક લાયકાત: ઉમેદવારે માન્યતા પ્રાપ્ત સંસ્થામાંથી સંબંધિત વિષયમાં એન્જિનિયરિંગની ડિગ્રી મેળવેલ હોવી જોઈએ. વિસ્તૃત જાણકારી ઓફિશિયલ વેબસાઈટ ૂૂૂ. ક્ષવાભ.શક્ષમશફ.ભજ્ઞળ પર મેળવી શકાશે. વય મર્યાદા: ઉમેદવારોની ઉંમર 30 વર્ષથી વધુ ન હોવી જોઈએ. અનામત વર્ગના ઉમેદવારોને સરકારી નિયમ મુજબ છૂટછાટ મળશે. એપ્લિકેશન ફી: ઉમેદવારો માટે એપ્લિકેશન ફી રૂા.295 છે. સેન્ટ્રલ બેન્ક ઓફ ઈન્ડિયામાં સ્પે.ઓફિસરની ભરતી: સેન્ટ્રલ બેન્ક ઓફ ઈન્ડિયાએ સિનિયર મેનેજર તરીકે સ્પેશિયાલિસ્ટ ઓફિસરની 19 જગ્યા માટે લાયકાત ધરાવતા ઉમેદવારો પાસેથી ઓનલાન અરજીઓ મંગાવવામાં આવે છે. ફોર્મ ભરવાની અંતિમ તારીખ: 2 માર્ચ 2022 શૈક્ષણિક લાયકાત: કોમ્પ્યુટર સાયન્સઆઈટીઈસીઈ અથવા એમસીએએમએસસી આઈટીએમએસસી કોમ્પ્યુટર સાયન્સ એન્જિનિયરિંગમાં ગ્રેજ્યુએટ ઉમેદવારો આ પોસ્ટ માટે અરજીઓ કરી શકશે. વિસ્તૃત માહિતી માટે ઓફિશિયલ વેબસાઈટ ૂૂૂ.ભયક્ષયિંબિફક્ષસજ્ઞરશક્ષમશફ.ભજ્ઞ.શક્ષ પરથી મળી રહેશે. વય મર્યાદા: ઉમેદવારની ઉંમર વધુમાં વધુ 35 વર્ષ અનામત વર્ગના ઉમેદવારોને સરકારી નિયમ મુજબ છૂટછાટ મળશે. એપ્લિકેશન ફી: જનરલઘઇઈ માટે ફી રૂા.850 જઈજઝઙઠઉ માટે ફી રૂા.175રિઝર્વ બેન્ક ઓફ ઈન્ડિયામાં આસિસ્ટન્ટની ભરતી ભારતીય રિઝર્વ બેંક પોતાના વિવિધ કાર્યાલયો માટે સહાયકોના 950 પદ માટે જગ્યાઓ બહાર પાડેલ છે. લાયકાત ધરાવતા ઉમેદવારો ઓનલાઇન અરજી કરી શકશે. ફોર્મ ભરવાની અંતિમ તારીખ: 8 માર્ચ 2022 શૈક્ષણિક લાયકાતો: સ્નાતક વિશેષ માહિતી માટે ઓફિશિયલ વેબસાઈટ ૂૂૂ.બિશ.જ્ઞલિ.શક્ષ પર માહિતી મળી જશે વયમર્યાદા: 28 વર્ષથી વધુ નહીં અનામત વર્ગના ઉમેદવારોને સરકારી નિયમ મુજબ છૂટછાટ મળશે એપ્લિકેશન ફી: જનરલઘઇઈઊઠજ ફી રૂા.450 જઈજઝ ફી રૂા.50ગુજરાત પંચાયત સેવા પંસદગી મંડળની ભરતી: ગુજરાત પંચાયત સેવા પસંદગી મંડળ દ્વારા પંચાયત સેવાની જુનિયર ક્લાર્ક વહીવટહિસાબવર્ગ3 1181 સંવર્ગની ખાલી જગ્યા પર સીધી ભરતીથી પસંદ કરવા માટે લાયકાત ધરાવતા ઉમેદવારો પાસે ઓનલાઈન અરજીઓ મંગાવવામાં આવી છે. ફોર્મ ભરવાની અંતિમ તારીખ: 8 માર્ચ 2022 શૈક્ષણિક લાયકાત: 12 પાસ વધુ માહિતી માટે ઓફિશિયલ વેબસાઈટ ૂૂૂ.જ્ઞષફત. લીષફફિિ.ંલજ્ઞદ.શક્ષ અથવા ૂૂૂ. લાતતબ.લીષફફિિ.ંલજ્ઞદ.શક્ષ જોવાની રહેશે. વયમર્યાદા: 36 વર્ષથી વધુ નહીં અનામત વર્ગના ઉમેદવારોને સરકારી નિયમ મુજબ છૂટછાટ મળશે એપ્લિકેશન ફી જનરલ રૂા.100 જઈજઝમહિલાએ ફી ભરવાની નથી | gujurati |
27 ಮರಿ 3 ಮೊಟ್ಟೆಗಳೊಂದಿಗೆ ಪತ್ತೆಯಾದ ಕೊಳಕುಮಂಡಲ ಹಾವು.! ಬೆಳಗಾವಿ: ಬೆಳಗಾವಿಯ ಹಿಂಡಾಲ್ ಕೋ ಕಂಪನಿಯ ವಾಲ್ನಲ್ಲಿ 27 ಮರಿಗಳೊಂದಿಗೆ ವಿಷಕಾರಿ ಕೊಳಕು ಮಂಡಲ ಹಾವು ಪತ್ತೆಯಾಗಿದೆ. ಬೆಳಗಾವಿ ನಗರದ ಹತ್ತಿರವಿರುವ ಹಿಂಡಾಲ್ ಕೋ ಕಂಪನಿಯ ಪಂಪ್ಹೌಸ್ನ ವಾಲ್ನಲ್ಲಿ ನಿನ್ನೆ ಮರಿಗಳೊಂದಿಗೆ ವಿಷಕಾರಿ ಕೊಳಕು ಮಂಡಲ ಹಾವು ಕಾಣಿಸಿಕೊಂಡಿದೆ. ಕೂಡಲೇ ಇದರ ಮಾಹಿತಿಯನ್ನು ಶಾಹೀದ್ ಅವರು ಎನಿಮಲ್ ರೆಸ್ಕ್ಯೂ ಟೀಂನ ವಿನಾಯಕ ಕೇಸರಕರ ಅವರಿಗೆ ನೀಡಿದ್ದಾರೆ. ಕೂಡಲೇ ಸ್ಥಳಕ್ಕಾಗಮಿಸಿದ ವಿನಾಯಕ ಕೇಸರಕರ ಮತ್ತು ಕಲಿಮುದ್ದೀನ ಶಾಹ್ ಅವರು ಮೊದಲೂ ತಾಯಿ ಹಾವನ್ನು ಹಿಡಿದರು. ನಂತರ ವಾಲ್ನಲ್ಲಿ ಅದರ 27 ಮರಿಗಳು ಮತ್ತು 3 ಮೊಟ್ಟೆಗಳು ಪತ್ತೆಯಾದವು. ಕೊಳಕು ಮಂಡಲ ಹಾವು ಅತ್ಯಂತ ವಿಷಕಾರಿ ಎನ್ನಲಾಗುತ್ತದೆ. 2 ಗಂಟೆಗಳ ಕಾಲ ಕಾರ್ಯಾಚರಣೆ ನಡೆಸಿ ಸುರಕ್ಷಿತವಾಗಿ ಹಾವುಗಳನ್ನು ಹಿಡಿದು ಕಾಡಿಗೆ ಬಿಡಲಾಗಿದೆ | kannad |
ರಾಜಧಾನಿಯಲ್ಲಿ ಮಳೆ ಅಬ್ಬರ: ಹೊಳೆಯಾದ ರಸ್ತೆಗಳು, ಜಲಾವೃತವಾದ ಮನೆಗಳು ಬೆಂಗಳೂರು: ರಾಜಧಾನಿಯಲ್ಲಿ ಮಂಗಳವಾರ ರಾತ್ರಿ ಅಬ್ಬರಿಸಿ ವಿವಿಧ ಕಡೆಗಳಲ್ಲಿ ಪ್ರವಾಹ ಪರಿಸ್ಥಿತಿ ತಂದೊಡ್ಡಿರುವ ಮಳೆ ಬುಧವಾರವೂ ತನ್ನ ಆರ್ಭಟ ಮುಂದುವರಿಸಿತು. ಬುಧವಾರ ಬೆಳಿಗ್ಗೆ ಯಾವುದೇ ಬಡಾವಣೆಗೆ ಹೋದರೂ ಭಾರಿ ಮಳೆ ಸೃಷ್ಟಿಸಿದ ಅವಾಂತರಗಳು ಎದ್ದು ಕಾಣಿಸುತ್ತಿದ್ದವು. ರಾತ್ರಿ ಇಡೀ ಮಳೆ ಸುರಿದಿದ್ದರೂ ಅನೇಕರಿಗೆ ಅದರ ಅರಿವೇ ಇರಲಿಲ್ಲ. ಬೆಳಿಗ್ಗೆ ಎದ್ದು ನೋಡಿದಾಗ ರಸ್ತೆಗಳು ನೀರಿನಿಂದ ಆವೃತವಾಗಿದ್ದವು. ನಾಗರಬಾವಿ, ಮೆಜೆಸ್ಟಿಕ್, ಶಾಂತಿನಗರ, ವಿಲ್ಸನ್ ಗಾರ್ಡನ್, ವಡ್ಡರಪಾಳ್ಯ, ಲಕ್ಕಸಂದ್ರ, ಗಿರಿನಗರ, ಹೊಸಕೆರೆಹಳ್ಳಿ, ಇಂದಿರಾನಗರ, ಚಾಮರಾಜಪೇಟೆ, ಶ್ರೀರಾಂಪುರ, ರಾಜಾಜಿನಗರ, ಆರ್.ಆರ್. ನಗರ ಸೇರಿದಂತೆ ನಗರದ ಬಹುತೇಕ ಭಾಗಗಳಲ್ಲಿ ಭಾರೀ ಮಳೆ ಸುರಿದಿದೆ. ಹೊರಮಾವು, ಎಚ್ಬಿಆರ್ ಲೇಔಟ್, ಸಹಕಾರ ನಗರ, ಚಿಕ್ಕಬಾಣಾವರ, ರಾಮಮೂರ್ತಿ ನಗರ, ಹೆಣ್ಣೂರು, ಮಾನ್ಯತಾ ಟೆಕ್ಪಾರ್ಕ್ ಸುತ್ತಮುತ್ತಲ ಬಡಾವಣೆಗಳು ಜಲಾವೃತಗೊಂಡವು. ಮನೆಯ ಬಳಿ ನಿಲ್ಲಿಸಿದ್ದ ಕಾರು ಮತ್ತು ಬೈಕ್ಗಳು ನೀರಿನಲ್ಲಿ ಮುಳುಗಿ ತೇಲಾಡವು. ಮನೆ, ಅಂಗಡಿ ಮುಂಗಟ್ಟುಗಳಿಗೂ ನುಗ್ಗಿದ್ದ ನೀರನ್ನು ಜನ ದಿನವಿಡೀ ಹೊರ ಹಾಕುವ ಕೆಲಸದಲ್ಲೇ ನಿರತರಾಗಿದ್ದರು. ಹೊರಮಾವು ಕೆರೆ ಪಕ್ಕದ ಬಡಾವಣೆಗಳು, ದಾಸರಹಳ್ಳಿಯ ರುಕ್ಮಿಣಿನಗರ, ವಿದ್ಯಾನಗರದಲ್ಲಿ ಮನೆಗಳಿಗೆ ನೀರು ನುಗ್ಗಿದ್ದರಿಂದ ಅಲ್ಲಿನ ಜನ ರಾತ್ರಿಯಿಡಿ ಜಾಗರಣೆ ಮಾಡುವಂತಾಗಿತ್ತು. ಶಿವಾನಂದ ವೃತ್ತ ರೈಲ್ವೆ ಸೇತುವೆ ಕೆಳಗೆ ನಿಂತಿದ್ದ ನೀರಿನಲ್ಲಿ ಹಲವು ಕಾರುಗಳು ಸಿಲುಕಿಕೊಂಡಿದ್ದವು. ಹೆಬ್ಬಾಳ ಮೇಲ್ಸೇತುವೆ ಕೆಳಭಾಗದ ರಸ್ತೆಯೂ ಸಂಪೂರ್ಣ ಜಲಾವೃತಗೊಂಡಿತ್ತು. ಬಸ್ ನಿಲ್ದಾಣ ಆವರಣ, ಹೆಬ್ಬಾಳದಿಂದ ಯಶವಂತಪುರ ಕಡೆಗೆ ಹೋಗುವ ರಿಂಗ್ ರಸ್ತೆಯು ಕೆರೆಯಂತಾಗಿತ್ತು. ಮಾನ್ಯತಾ ಟೆಕ್ಪಾರ್ಕ್ನಲ್ಲಿ ರಸ್ತೆಗಳೆಲ್ಲ ಜಲಾವೃತವಾಗಿದ್ದವು. ಪುಟ್ಟೇನಹಳ್ಳಿ ಜೈನ ಬಸದಿ ಮುಂಭಾಗದಲ್ಲಿ ಒಳಚರಂಡಿ ಒಡೆದು ಮಂದಿರದ ಒಳಗೆ ನೀರು ನುಗ್ಗಿ ಅವಾಂತರ ಸೃಷ್ಟಿಸಿತು. | kannad |
Recently, Amazon announced that you can get a free linux VM for one year in their public cloud solution - Amazon Web Services (AWS). They call it a Micro Instance and it's got something like 1 vCPU, 600 MB of memory, and 10 GB storage, see specs here. You get full access to the VM via SSH but there's no console access as such.
So I decided to give it a try.
First, you need to create an AWS account (there's a link on the front page..). They need a valid creditcard for that. Then you log into the AWS Management Console. This requires you to register again. They had implemented a rather odd security feature where they call your mobile phone and you have to punch in a pin-number to confirm. I must admit that, for testing purposes, this wasn't the most smooth registration process.
Once into the AWS Management Console you're presented with a number of tabs. The first one is Amazon S3 which is an online file placeholder (i guess like an FTP server). To create your VM, go to the Amazon EC2 tab and click on Launch Instance (see below). This process is fairly simple. It is not quite easy, though, to see exactly which one is the free edition, but I just chose the minimum specs available to be on the safe side. And look for something like linux and Micro Instance.
Firewall rules are easy to configure via the web interface. You can add some pre-defined ports such as mail, web, etc. Port 22 is enabled by default.
If you use this command will receive a login error as root cannot login directly. So just change 'root' in front of the @ with the, in the error message, suggested 'ec2-user'.
Once logged in you can execute commands as root with the 'sudo' command. It will not prompt for a password. Or alternatively use sudo -i to get a root console. But you can't su - root.
If you want to use Putty to acces the VM directly, then you have to convert the .pem file to a .ppk file. This is easily done using this guide.
To use the .ppk file, open Putty and go to SSH -> Auth and browse to the directory where you stored the file. And then you connect to the VM (saving the profile will save you some time at next login..). There's no password.
The same .ppk file can also be used for WinSCP which is handy for uploading files directly to the VM.
As you have a public DNS name, this can be used to create an eiasier to remember C-name DNS that you can point to the generated machine name.
So far so good. Now there's access via SSH. Then I tried to configure a simple web server. I'll describe that in the next post. | english |
/*
* Created on 2.6.2003
*
* To change the template for this generated file go to
* Window>Preferences>Java>Code Generation>Code and Comments
*/
package se.idega.block.pki.business;
import se.nexus.nbs.sdk.NBSAuthResult;
import com.idega.core.accesscontrol.business.LoggedOnInfo;
/**
* @author gummi
*
* To change the template for this generated type comment go to
* Window>Preferences>Java>Code Generation>Code and Comments
*/
public class NBSLoggedOnInfo extends LoggedOnInfo {
private NBSAuthResult _nbsAuthResult = null;
public final static String KEY_PERSONAL_ID = "serialNumber";
private final static String _nameKey = "CN";
private final static String _organizationKey = "O";
private final static String _countryKey = "C";
private final static String givenNameKey = "givenName";
private final static String SurNameKey = "SN";
public String getNBSPersonalID(){
return _nbsAuthResult.getSubjectAttributeValue(KEY_PERSONAL_ID);
}
public String getNBSCommonName(){
return _nbsAuthResult.getSubjectAttributeValue(_nameKey);
}
public String getNBSCountry(){
return _nbsAuthResult.getSubjectAttributeValue(_organizationKey);
}
public String getNBSOrganization(){
return _nbsAuthResult.getSubjectAttributeValue(_countryKey);
}
public String getGivenName(){
return _nbsAuthResult.getSubjectAttributeValue(givenNameKey);
}
public String getSurName(){
return _nbsAuthResult.getSubjectAttributeValue(SurNameKey);
}
/**
* @return
*/
public NBSAuthResult getNbsAuthResult() {
return _nbsAuthResult;
}
/**
* @param result
*/
public void setNbsAuthResult(NBSAuthResult result) {
_nbsAuthResult = result;
}
}
| code |
ஆந்திராவில் மசூதி கட்டும் விவகாரத்தில் கலவரம் காவல் நிலையம் மீது தாக்குதல் பாஜ நிர்வாகியின் கார் எரிப்பு: கூட்டத்தை கலைக்க போலீசார் துப்பாக்கிச்சூடு திருமலை: ஆந்திராவில் மசூதி கட்டுவதில் இரு பிரிவினரிடையே பயங்கர மோதல் ஏற்பட்டு கலவரமாக மாறியது. இதில் போலீஸ் நிலையத்தின் மீது கற்கள் வீசி தாக்கி, பாஜ நிர்வாகியின் காருக்கு தீ வைத்து எரித்தனர். கலவரக்காரர்களை கலைக்க போலீசார் துப்பாக்கிச்சூடு நடத்தினர். ஆந்திர மாநிலம், கர்னூல் மாவட்டத்தில் உள்ள ஆத்மகூரில் நேற்று முன்தினம் மசூதி கட்டுவது தொடர்பாக இரு பிரிவினரிடையே பயங்கர மோதல் ஏற்பட்டது. அப்போது, அங்கு வந்த ஸ்ரீசைலம் தொகுதி பாஜ கட்சியின் தலைவர் புத்த ஸ்ரீகாந்த்தின் கார் மீது கற்களை வீசி தாக்குதல் நடத்தினர். இது குறித்து தகவலறிந்த ஸ்ரீசைலம் போலீசார் சம்பவ இடத்திற்கு விரைந்து வந்து ஸ்ரீகாந்த்தை பாதுகாப்பாக காவல் நிலையத்துக்கு அழைத்துச் சென்றனர். இதையடுத்து, காவல் நிலையத்தை முற்றுகையிட்ட மற்றொரு பிரிவினர், ஸ்ரீகாந்த்தின் காரை கவிழ்த்து காவல் நிலையத்தின் முன்பே தீ வைத்து கொளுத்தினர். மேலும், காவல் நிலையத்தின் மீது கற்களை வீசி தாக்குதல் நடத்தினர். கலவரக்காரர்களை கலைக்க முடியாததால் போலீசார் வானத்தை நோக்கி துப்பாக்கிச்சூடு நடத்தி இருபிரிவினரையும் கலைத்தனர். இருப்பினும், அங்கு பதற்றமான சூழல் ஏற்பட்டுள்ளது. அங்கு ஏராளமான போலீசார் குவிக்கப்பட்டுள்ளனர். இச்சம்பவம் அப்பகுதியில் பெரும் பரபரப்பை ஏற்படுத்தி உள்ளது.இது குறித்து ஆந்திர மாநில டிஜிபி கவுதம்சவாங் வெளியிட்டுள்ள அறிக்கையில், அமைதியான கர்னூல் மாவட்டத்தில் மதவெறியை தூண்ட சிலர் வேண்டுமென்றே முயற்சிக்கின்றனர். அவர்கள் மீது காவல் துறை கடுமையான நடவடிக்கை எடுக்கும். ஆத்மகூர் சம்பவத்திற்கு பிறகு உடனே அப்பகுதிக்கு சென்று நிலைமையை கண்காணிக்க மாவட்ட எஸ்பிக்கு உத்தரவிட்டுள்ளேன். தற்போதைக்கு நிலைமை முற்றிலும் கட்டுக்குள் உள்ளது. மதவெறியை, மத கலவரத்தை தூண்ட முயன்றவர் யாராக இருந்தாலும் கடும் நடவடிக்கை எடுக்கப்படும், என கூறியுள்ளார். | tamil |
બુટલેગરોના બદલે દૂધ વેચતા માલધારી સમાજને જેલમાં ધકેલવાનો કારસો ડીસા જિલ્લા પંચાયતના વિશ્રામ ગૃહ ખાતે શનિવારે કોંગ્રેસ માલધારી સેલ સંગઠનની એક બેઠક યોજાઈ હતી. જેમાં ડીસા શહેર અને તાલુકા કોંગ્રેસના આગેવાનો સહિત માલધારી સમાજના આગેવાનો મોટી સંખ્યામાં ઉપસ્થિત રહ્યા હતાં તેમજ આજે શનિવારે રાજીવ ગાંધી નિર્વાણ દિન હોઈ તે નિમિત્તે શ્રદ્ધાંજલિ અર્પણ કરી કાર્યક્રમની શરૂઆત કરવામાં આવી હતી. જેમાં ગુજરાત સરકાર દ્વારા તાજેતરમાં માલધારી સમાજ વિરુદ્ધમાં કાળો કાયદો પસાર કરવામાં આવ્યો જે કાયદાનો ખુલ્લેઆમ વિરોધ નોંધાવ્યો હતો ગુજરાતમાં દારૂના બુટલેગરો ખુલ્લેઆમ દારૂનું વેચાણ કરી રહ્યા છે.પણ દુઘ વેચતાં માલધારી સમાજને જેલમાં મોકલી આપવાનો કાળો કાયદો ઘડાયો હોવાનો પ્રદેશ માલધારી સેલ પ્રમુખ દ્વારા બેઠકમાં રજુઆત કરવામાં આવી હતી તેમજ રાજય સરકારની ઝાટકણી કાઢતાં ભારે આકોશ વ્યક્ત કરાયો હતો. સાથે સાથે ગુજરાતમાં વિધાનસભાની ચૂંટણી નજીક આવી રહી છે ત્યારે કોંગ્રેસ વધુમાં વધુ મજબૂત બને તે હેતુથી આજે યોજાયેલ માલધારી સેલની બેઠકમાં ચર્ચા વિચારણા કરવામાં આવી હતી જ્યારે આજે યોજાયેલ બેઠકમાં ડીસા શહેર કોંગ્રેસ પ્રમુખ તાલુકા કોંગ્રેસ પ્રમુખ સહિત પુર્વ ધારાસભ્ય ગોવાભાઈ દેસાઈ સાથે કોંગ્રેસના આગેવાનો કાર્યકર્તાઓ એન. એસ. યુ. આઈ. કાર્યકર્તાઓ મોટી સંખ્યામાં ઉપસ્થિત રહ્યા હતાં. | gujurati |
W.g : వరద ముంపు బాధితులకు ఎంఎల్ఎ తెల్లం బాలరాజు పరామర్శ టి.నరసాపురం పశ్చిమ గోదావరి : గులాబ్ తుపాను ప్రభావంతో టి.నరసాపురంలో ముంపుకు గురైన వరద బాధిత కుటుంబాలను పోలవరం ఎంఎల్ఎ తెల్లం బాలరాజు బుధవారం పరామర్శించారు. బాధితులకు అండగా ఉంటామని హామీ ఇచ్చారు. నిరాశ్రయులకు నిత్యావసర సరకులు, బియ్యంను పంపిణీ చేశారు. ఎర్రచెరువుకు వరద బెడద లేకుండా శాశ్వత పరిష్కారంగా డ్రైనేజీ నిర్మాణానికి శంకుస్థాపన చేశారు. ఈ కార్యక్రమంలో ఎంపిపి దారబోయిన లక్ష్మి, జడ్పిటిసి సభ్యుల సామంత పూడి సూరిబాబు, దేవరపల్లి ముత్తయ్య, తదితరులు పాల్గొన్నారు. | telegu |
ভেজ কর্ন রায়তা আপনি ভেজ কর্ন দিয়ে এই রায়তা তৈরি করতে পারেন এবং এটি পুরোপুরি উপভোগ করতে পারেন চলুন জেনে নিই কিভাবে তৈরি করবেন ভেজ কর্ন রায়তা ভেজ কর্ন রায়তা তৈরির উপকরণ সব ধরনের সবজি, যেমন বাঁধাকপি, মটরশুঁটি, আলু, ফ্রেঞ্চ বিনস, গাজর ১কাপ করে সব সবজি ছোট ছোট টুকরো করে কাটা, ভুট্টা ছোট ছোট টুকরো করে কাটা, পেঁয়াজ ১ টি, দই ৫০০ গ্রাম, কারি পাতা ৪৫ টি, চিনি ১ চা চামচ, কাঁচা লংকা ১টি, সরিষার তেল ১ চা চামচ, লবণ স্বাদ অনুযায়ী ভেজ কর্ন রায়তা তৈরির পদ্ধতি সব কাটা উপাদান, যেমন কাটা শাকসবজি, ভুট্টা এবং পেঁয়াজ সব মিশিয়ে সেদ্ধ করুন একটি কড়াইতে তেল দিয়ে গরম করুন এই গরম তেলে সরিষা, কারিপাতা, কাঁচা লংকা দিয়ে হালকা লাল করে নিন সেদ্ধ সবজিগুলো ছেঁকে নিয়ে এতে দিন এরপর স্বাদ অনুযায়ী লবণ ও চিনি মিশিয়ে ফেটানো দই দিয়ে ভালো করে কিছুক্ষণ নাড়ুন সব উপকরণ মিশে গেলে সবুজ ধনেপাতা দিয়ে সাজিয়ে পরিবেশন করুন | bengali |
اسلام باد ڈیلی پاکستان لائن وزارت داخلہ کی جانب سے یہ وضاحت جاری کی گئی ہے کہ حکومت پاکستان کی طرف سے ایک سال کے دوران 104 ارب ڈالر کے قرضے لینے کی خبر تصویر کا ایک رخ ہے وضاحتی بیان میں کہا گیا ہے کہ حکومت نے 18 اگست 2018 سے 30 ستمبر 2019 کے دوران 104 ارب ڈالر کے غیر ملکی قرضے ضرور لیے ہیں لیکن 91 ارب ڈالر کے قرضے واپس بھی کیے ہیں اس طرح پاکستان پر غیر ملکی قرضوں کا بوجھ 104 نہیں بلکہ 13 ارب ڈالر بڑھا ہے وضاحتی بیان میں کہا گیا ہے کہ 104 ارب ڈالر کے قرضے لینے کی بات کرنا قومی سلامتی کے خلاف ہے کیونکہ اس سے پاکستان کی تیزی سے بڑھتی ہوئی مارکیٹ پر برے اثرات مرتب ہوں گے | urdu |
PM Modi: শুরু হল লতা দীননাথ মঙ্গেশকর পুরস্কার, প্রথম প্রাপক নরেন্দ্র মোদি ভারতের সুরসম্রাজ্ঞী লতা মঙ্গেশকর ও তাঁর পিতা দীননাথ মঙ্গেশকরের নামে নামাঙ্কিত পুরস্কারে ভূষিত হতে চলেছেন প্রধানমন্ত্রী নরেন্দ্র মোদি আজ ২৪ এপ্রিল , প্রয়াত গায়িকার পিতার ৮০তম মৃত্যুবার্ষিকী কিছুদিন আগে লতা মঙ্গেশকরও পাড়ি দিয়েছেন অমৃতলোকে তাই এই উপলক্ষে লতাজির সম্মানে লতা দীনানাথ মঙ্গেশকর নামক একটি পুরস্কার প্রদান শুরু করা হয়েছে মঙ্গেশকর পরিবারের তরফে প্রথম পুরস্কার বিজেতা আর কেউ নন, প্রধানমন্ত্রী নরেন্দ্র দামোদর মোদি চলতি বছর ৬ ফেব্রুয়ারি না ফেরার দেশে পারি দিয়েছেন ভারতের নাইটিঙ্গেল লতা মঙ্গেশকর মূলত কিংবদন্তি গায়িকার স্মরণে তাঁর পরিবারের পক্ষ থেকে প্রতি বছর এই লতা দীননাথ পুরস্কার দেওয়ার ঘোষণা করা হয়েছে লতাদিদির পরিবারের তরফে বলা হয়েছে , প্রতি বছর মাস্টার দীনানাথ মঙ্গেশকরের মৃত্যুবার্ষিকীতে এই পুরস্কারে ভূষিত হবেন দেশের এমন একজন ব্যক্তি, যিনি দেশ ও সমাজের জন্য নিঃস্বার্থভাবে কাজ করেছেন এবং সামাজিক উন্নয়নে অবদান রেখেছেন এই বছর সেই পুরস্কার পাচ্ছেন প্রধানমন্ত্রী নরেন্দ্র মোদি আরও পড়ুন : Irfan Khan: কেন ভারতে শুটিং করতে চাননি জনি ডেপ, জানিয়েছিলেন ইরফান খান আরও পড়ুন : Siddharth kiara: পর্দার মতো বাস্তবেও একসঙ্গে থাকা হল না শেরশাহ জুটির, বিচ্ছেদ হয়ে গেল সিদ্ধার্থকিয়ারার! পরিবারের তরফে আরও বলা হয় , আমরা আনন্দিত এবং সম্মানিত হয়ে ঘোষণা করছি যে এই পুরস্কারের প্রথম বিজয়ী আর কেউ নন, ভারতের মাননীয় প্রধানমন্ত্রী নরেন্দ্র মোদি তিনি একজন আন্তর্জাতিক রাজনীতিবিদ যিনি ভারতকে বিশ্ব নেতৃত্বের পথে নিয়ে গেছেন প্রকৃতপক্ষে তিনি আমাদের মহান জাতির অন্যতম শ্রেষ্ঠ নেতা জানা গিয়েছে , আজ সন্ধ্যায় একটি অনুষ্ঠান আয়োজন করা হয়েছে সেখানে পুরস্কার বিতরণী অনুষ্ঠান চলবে রবিবার সন্ধ্যা ৬টা থেকে ৬ টা ১৫ মিনিট পর্যন্ত এরপর রাত ৮ নাগাদ শুরু হবে কনসার্ট সঙ্গীত অনুষ্ঠান স্বরা লতাঞ্জলি পরিচালনা করবেন বিখ্যাত গায়ক রূপকুমার রাঠোড যেখানে প্রয়াত স্বনামধন্যা গায়িকা লতা দিদির অমর সুর ও স্মৃতির প্রতি শ্রদ্ধা নিবেদন করা হবে শুধু সমাজ বা মানুষের জন্য কাজ নয় , মাস্টার দীনানাথ মঙ্গেশকর পুরস্কারের উদ্দেশ্য সঙ্গীত, নাটক, শিল্প, চিকিত্সা এবং সামাজিক কাজের ক্ষেত্রে বিশিষ্ট ব্যক্তিদের সম্মান জানানো মঙ্গেশকর পরিবার সূত্রে খবর, প্রবীণ অভিনেত্রী আশা পারেখ এবং অভিনেতা জ্যাকি শ্রফকে সিনেমায় অবদানের জন্য বিশেষ সম্মান হিসেবে মাস্টার দীনানাথ পুরস্কার দেওয়া হবে তাছাড়া, ভারতীয় সঙ্গীতের বিশেষ অবদানের জন্য মাস্টার দীনানাথ পুরস্কার পাবেন রাহুল দেশপান্ডে সেরা নাট্য পুরস্কার দেওয়া হবে সঞ্জয় ছায়া নামের একটি নাটককে | bengali |
പെഗാസസില് കേന്ദ്രസര്ക്കാരും പ്രതിപക്ഷവും നേര്ക്കുനേര്: പ്രകോപനത്തില് വീഴരുതെന്ന് ബിജെപി എംപിമാരോട് മോദി ദില്ലി: പെഗാസസ് ഫോണ്ചോര്ത്തല് വിഷയത്തില് പ്രതിപക്ഷത്തിനും സര്ക്കാരിനുമിടയിലെ ഭിന്നത രൂക്ഷം. രാജ്യസഭയില് ബഹളം വച്ച ആറ് തൃണമൂല് കോണ്ഗ്രസ് എംപിമാരെ ഒരു ദിവസം മാറ്റി നിറുത്തി നടപടിയെടുത്തു. പ്രകോപനത്തില് വീഴരുതെന്ന് പ്രധാനമന്ത്രി നരേന്ദ്ര മോദി ബിജെപി എംപിമാരോട് ആവശ്യപ്പെട്ടു. ഫോണ്ചോര്ത്തലില് അന്വേഷണം ആവശ്യപ്പെട്ടുള്ള ഹര്ജികള് നാളെ സുപ്രീംകോടതി പരിഗണിക്കും. ദിവസങ്ങള് നീണ്ട പ്രതിഷേധത്തിനും പോര്വിളികള്ക്കും ഒടുവില് പാര്ലമെന്റില് പെഗാസസ് ഫോണ് ചോര്ത്തലില് ചര്ച്ചയുണ്ടാവില്ലെന്ന് ഉറപ്പായി. വലിയ തര്ക്കത്തിനാണ് ഈ ദിവസങ്ങളില് രണ്ടു സഭകളും സാക്ഷ്യം വഹിക്കുന്നത്. രാജ്യസഭയില് രാവിലെ പ്ലക്കാര്ഡുകളുമായി നടുത്തളത്തിലിറങ്ങിയ ആറ് എംപിമാരെയാണ് ഒരു ദിവസത്തേക്ക് മാറ്റി നിര്ത്തിയത്. തൃണമൂല് കോണ്ഗ്രസിന്്റെ ഡോള സെന്, നദിമുള് ഹഖ്, അബിര് രഞ്ജന് ബിശ്വാസ്, ശാന്ത ഛേത്രി, അര്പ്പിത ഘോഷ്, മൗസം നൂര് എന്നിവര്ക്കെതിരെയാണ് നടപടി എടുത്തത്. ഉച്ചയ്ക്ക് ശേഷം രാജ്യസഭ ചേര്ന്നപ്പോള് കൂടുതല് പേര് പ്ളക്കാര്ഡുകളുമായി ഇറങ്ങി. ഇടതുപക്ഷ എംപിമാര് പെഗാഗസസ് അന്വേഷണം ആവശ്യപ്പെട്ട് മലയാളത്തിലുള്ള പ്ളക്കാര്ഡുകളുമായാണ് എത്തിയത്. പ്രതിപക്ഷത്തിന്്റെ പ്രകോപനത്തില് വീഴരുത് എന്ന് പ്രധാനമന്ത്രി ബിജെപി എംപിമാരോട് ആവശ്യപ്പെട്ടു. പ്രതിപക്ഷം നടുത്തളത്തില് വന്ന് കാട്ടുന്ന ബഹളം അംഗീകരിക്കാനാവില്ല. എന്നാല് സംയമനത്തോടെ ഇത് നേരിടണം എന്ന നിര്ദ്ദേശമാണ് നരേന്ദ്ര മോദി പാര്ട്ടി എംപിമാര്ക്ക് നല്കിയത്. ലോക്സഭയില് ബഹളത്തിനിടെ നാളികേര വികസനബോര്ഡില് സിഇഒയെ നിയമിക്കാനും അംഗങ്ങളുടെ എണ്ണം കൂട്ടാനുമുള്ള ബില് ചര്ച്ചയില്ലാതെ പാസാക്കി. ഇതിനിടെ കാര്ഷിക ബില്ലുകള്ക്കെതിരെ അകാലിദള് എംപിമാര് പാര്ലമെന്റ് കവാടത്തില് പ്രതിഷേധിക്കുമ്ബോള് കോണ്ഗ്രസ് എംപി റവനീത് സിംഗ് ബിട്ടു ചോദ്യം ചെയ്തത് വാഗ്വാദത്തിന് ഇടയാക്കി. ബഹളത്തിനിടെ ബില്ലുകള് പാസാക്കുന്നതിനെതിരെ എന്കെ പ്രേമചന്ദ്രന് സ്പീക്കര്ക്ക് കത്തുനല്കി. നാളെ സുപ്രീംകോടതി പെഗാസസ് ഫോണ് ചോര്ത്തലിലെ ഹര്ജികള് പരിഗണിക്കുന്ന പശ്ചാത്തലത്തില് ഈ വിവാദം എങ്ങനെ മുന്നോട്ടു പോകും എന്നത് ഇനി കോടതി ഇടപെടല് നിര്ണ്ണയിക്കും. കൊവിഡ് മഹാമാരിയുടെ രണ്ടാംവരവിന്റെ ഈ കാലത്ത്, എല്ലാവരും മാസ്ക് ധരിച്ചും സാനിറ്റൈസ് ചെയ്തും സാമൂഹ്യ അകലം പാലിച്ചും വാക്സിന് എടുത്തും പ്രതിരോധത്തിന് തയ്യാറാവണമെന്ന് ഏഷ്യാനെറ്റ് ന്യൂസ് അഭ്യര്ത്ഥിക്കുന്നു. ഒന്നിച്ച് നിന്നാല് നമുക്ക് ഈ മഹാമാരിയെ തോല്പ്പിക്കാനാവും. BreakTheChain ANCares IndiaFightsCorona Last Updated Aug 4, 2021, 7:26 PM IST pegasus modi narendra modi amit sha bjp congress rahul gandhi tmc പെഗാസസ് മോദി അമിത് ലോക്സഭാ രാജ്യസഭാ ബിജെപി | malyali |
कैंडल मार्च निकालकर ट्रैकमेंटेनर ने किया घटना का विरोध बिलासपुर। प्रयागराज रेल मंडल के पनकी स्टेशन में ट्रैकमैन रमेश कुमार यादव ने अपने अधिकारी सीके तिवारी की तानाशाही रवैए से तंग आकर ट्रैक पर कटकर जान दे दी। इसी घटना के विरोध में यहां भी ट्रैकमैन एसोसिएशन से कैंडल मार्च निकालकर महाप्रबंधक की अनुपस्थिति में मंडल रेल प्रबंधक को रेलवे बोर्ड चेयरमैन के नाम ज्ञापन सौंपा। इस दौरान शिकायत भी की गई कि बिलासपुर रेल मंडल समेत जोन के तीनों मंडल में कुछ पीडब्ल्यूआइ इसी तरह ट्रैकमेंटेनरों को परेशान करते हैं। पनकी स्टेशन की इस घटना से भारतीय रेलवे के सभी जोन में आक्रोश है। ट्रैकमैन एसोसिएशन लगातार विरोध प्रदर्शन कर रहा है। इसी के तहत ही गुरुवार को ट्रैकमैन एसोसिएशन ने कैंडल मार्च निकाला। आल इंडिया रेलवे ट्रैकमेंटेनर यूनियन के राष्ट्रीय सहायक महामंत्री व दक्षिण पूर्व मध्य रेलवे ट्रैकमैन एसोसिएशन के अध्यक्ष राजेंद्र कुमार कौशिक ने बताया कि घटना से भारतीय रेलवे के ट्रैकमैनों के साथसाथ बिलासपुर जोन के ट्रैकमैनांे को गहरा आघात पहुंचा है और इस घटना के दोषी अधिकारी के लिए काफी आक्रोश है। कैंडल मार्च कर घटना के विरोध में एसोसिएशन ने अपनी प्रतिक्रिया दी है। इस दौरान उनका कहना था कि बिलासपुर जोन में भी कुछ पीडब्ल्यूआइ अधिकारियों द्वारा ट्रैकमैनों को परेशान किया जाता है। गलत व्यवहार के साथ अपशब्दों का प्रयोग किया जाता है। बेवजह बातबात में अनुपस्थित कर दिया जाता है। छुट्टी भी नहीं देते। ऐसी घटना की सूचना पर समयसमय पर एसोसिएशन के पदाधिकारी पीडब्ल्यूआइ को समझाइश देते हैं और बात नहीं बनती है तो ऊपर अधिकारियों तक समस्या को उठाते हैं। राष्ट्रीय उपाध्यक्ष एवं ट्रैकमेंटेनर एसोसिएशन बिलासपुर जोन के महामंत्री संजय गुप्ता ने बताया कि ज्ञापन सौंपकर ऐसी घटना की पुनरावृत्ति न हो इसकी मांग की गई। संजय गुप्ता ने बताया कि सीनियर डीएन कोआर्डिनेशन को भी मंडल में ऐसी घटना पर रोक लगाने के लिए पहले से ही कमेटी बनाकर ट्रैकमैनों की समस्या का समाधान करने के लिए ज्ञापन सौंपा है। कैंडल मार्च का आल इंडिया लोको रनिंग स्टाफ एसोसिएशन के मंडल सचिव वीके तिवारी, एचएस भदोरिया, ओबीसी एसोसिएशन के मंडल सचिव एस मधुसूदन राव, स्वतंत्र रेलवे कर्मचारी यूनियन के महामंत्री बीआर शाह,भारतीय रेलवे मजदूर संघ के महामंत्री संतोष पटेल ने नैतिक समर्थन देते हुए शामिल हुए। | hindi |
kolkata: নিউটাউনে বন্ধ ঘর থেকে উদ্ধার মহিলার মৃতদেহ নিজস্ব প্রতিবেদন: নিউটাউনের নতুনপুকুর এলাকায় একটি বন্ধ ঘর থেকে মহিলার মৃতদেহ উদ্ধার ঘিরে চাঞ্চল্য ছড়াল ঘটনাস্থলে এসে পোঁছায় টেকনো সিটি থানার পুলিশ মৃতের নাম অঞ্জলি মন্ডল স্থানীয় সূত্রে খবর, ওই বাড়িতে মহিলার বাড়ি ২৪ পরগনার কামারগাতী এলাকায় কর্মসূত্রে নতুন পুকুর এলাকায় প্রায় দুবছর ধরে ভাড়া থাকছিল সঙ্গে গোকুল সরদার নামে আরও একটি ছেলেও থাকতো বলে পরিবার সূত্রে খবর আজ সকালেই বাড়ির মালিক ও মহিলার সঙ্গে থাকা গোকুল পরিবারের অন্য সস্যদের ডেকে দেখায় গলায় ফাঁস দেওয়া অবস্থায় রয়েছে অঞ্জলি মণ্ডল এরপরই টেকনোসিটি থানায় খবর দেওয়া হলে পুলিশ গিয়ে মৃত দেহ উদ্ধার করে ময়নতদন্তের পাঠিয়েছে পরিবারের অভিযোগ, অঞ্জলি মন্ডল এর সঙ্গে থাকত গোকুল সরদার নামে ওই ছেলেটিই তাকে মেরে ফেলেছে পরিবারের তরফ থেকে অভিযোগও জানানো হয়েছে টেকনো সিটি থানায় মৃত্যুর আসল কারণ জানতে তদন্তে টেকনো সিটি থানার পুলিশ অন্যদিকে কিছুদিন আগে ,নিউটাউনে বাইক দুর্ঘটনায় মারা যায় রোহান ধাঞ্চলিয়া নামক এক ব্যক্তি লেকটাউন বাঙ্গুরের বাসিন্দা ভোর তিনটে নাগাদ দুর্ঘটনা ঘটে দুর্ঘটনার পিছনে কি কারণ আছে খতিয়ে দেখছে নিউটাউন থানার পুলিসপুলিশ সূত্রে খবর, রাত প্রায় তিনটে নাগাদ নিউটাউন থানায় খবর যায় যে নিউটাউন নারকেল বাগান এর কাছে রক্তাক্ত অবস্থায় এক বাইক আরোহী পড়ে আছে খবর পেয়ে নিউটাউন থানার পুলিস ঘটনাস্থলে গিয়ে তড়িঘড়ি বিধান নগর মহকুমা হাসপাতালে নিয়ে গেলে মৃত বলে ঘোষণা করে নারকেল বাগান হয়ে সল্টলেকের দিকে যাচ্ছিল রোহণ মাথায় হেলমেট ছিল কিনা সেটাও খতিয়ে দেখা হচ্ছে সূত্রের খবর কোনো একটি গার্মেন্টস কোম্পানিতে কাজ করত Keykhabor | bengali |
ʼಮಾಸ್ಕ್ ಟು ಮಾಸ್ಕ್ʼ ಚುಂಬನ ಎಷ್ಟು ಸುರಕ್ಷಿತ..? ಇಲ್ಲಿದೆ ಒಂದಷ್ಟು ಮಾಹಿತಿ ಮಾಸ್ಕ್ ಧರಿಸಿಯೇ ಕಿಸ್ ಮಾಡೋದು ಸದ್ಯ ಚಾಲ್ತಿಯಲ್ಲಿರುವ ಟ್ರೆಂಡ್ಗಳಲ್ಲಿ ಒಂದಾಗಿದೆ. ಕೆಲ ದಿನಗಳ ಹಿಂದಷ್ಟೇ ಅಮೆರಿಕ ಉಪಾಧ್ಯಕ್ಷೆ ಕಮಲಾ ಹ್ಯಾರಿಸ್ ಹಾಗೂ ಅವರ ಪತಿ ಮಾಸ್ಕ್ ಧರಿಸಿಯೇ ಚುಂಬನ ಮಾಡಿಕೊಂಡಿದ್ದ ದೃಶ್ಯ ವೈರಲ್ ಆಗಿತ್ತು. ಅದೇ ರೀತಿ ನಟ ವರುಣ್ ಸೂದ್ ತನ್ನ ಗರ್ಲ್ಫ್ರೆಂಡ್ ದಿವ್ಯಾ ಅಗರ್ವಾಲ್ಗೆ ಮುಂಬೈ ವಿಮಾನ ನಿಲ್ದಾಣದಲ್ಲಿ ಮಾಸ್ಕ್ ಧರಿಸಿಯೇ ಮುತ್ತನ್ನಿಟ್ಟ ದೃಶ್ಯ ಎಲ್ಲರ ಹುಬ್ಬೇರುವಂತೆ ಮಾಡಿತ್ತು. ಆದರೆ ಇದೀಗ ಎಲ್ಲರಲ್ಲೂ ಕಾಡುತ್ತಿರುವ ಪ್ರಶ್ನೆ ಏನೆಂದರೆ ಈ ರೀತಿ ಮಾಸ್ಕ್ ಧರಿಸಿ ಕಿಸ್ ಮಾಡೋದು ಎಷ್ಟು ಸೇಫ್..? ಅನ್ನೋದಾಗಿದೆ. ವಿಶ್ವದಲ್ಲಿ ಕೊರೊನಾ ವಿರುದ್ಧ ಲಸಿಕೆ ಅಭಿಯಾನವೇನೋ ನಡೆಯುತ್ತಿದೆ. ಆದರೆ ಇನ್ನೂ ಎಲ್ಲರೂ ಲಸಿಕೆಯನ್ನ ಪಡೆದಿಲ್ಲ. ಕೊರೊನಾಗೆ ಇನ್ನೂ ಶಾಶ್ವತ ಪರಿಹಾರ ಸಿಗದ ಈ ಸಂದರ್ಭದಲ್ಲಿ ಈ ರೀತಿ ಮಾಸ್ಕ್ ಕಿಸ್ ಎಷ್ಟು ಸುರಕ್ಷಿತ ಅನ್ನೋದರ ಬಗ್ಗೆ ಡಾ. ಅನುಭಾ ಸಿಂಗ್ ಮಾಹಿತಿ ನೀಡಿದ್ದಾರೆ. ಮಾಸ್ಕ್ ಧರಿಸಿದರೆ ಕೋವಿಡ್ 19ನಿಂದ ಬಚಾವಾಗಬಹುದಾಗಿದೆ. ಇದು ದೇಹಕ್ಕೆ ಪ್ರವೇಶಿಸುವ ವೈರಾಣುಗಳನ್ನ ತಡೆಗಟ್ಟುವ ಸಾಮರ್ಥ್ಯ ಹೊಂದಿರೋದ್ರಿಂದ ಈ ಸಮಯದಲ್ಲಿ ಮಾಸ್ಕ್ ಧರಿಸಲೇಬೇಕಿದೆ. ಹಾಗಂತ ಮಾಸ್ಕ್ ಧರಿಸಿದ ಮಾತ್ರಕ್ಕೆ ಕಾಯಿಲೆಯ ಅಪಾಯವಿಲ್ಲ ಅನ್ನೋದು ಎಲ್ಲಿಯೂ ಸಾಬೀತಾಗಿಲ್ಲ ಎಂದು ಅನುಭಾ ಹೇಳಿದ್ದಾರೆ. ಮಾಸ್ಕ್ಗಳು ಒಂದು ರೀತಿ ಕಾಂಡೋಮ್ಗಳಂತೆ. ನೀವು ಸರಿಯಾದ ರೀತಿಯಲ್ಲಿ ಇದನ್ನ ಬಳಕೆ ಮಾಡಿದ್ರೆ ನಿಮಗೆ 100 ಪ್ರತಿಶತ ಸುರಕ್ಷತೆ ಸಿಗಲಿದೆ. ಹೀಗಾಗಿ ಮಾಸ್ಕ್ ಹಾಕಿ ಕಿಸ್ ಮಾಡುವ ವೇಳೆಯೂ ತುಂಬಾನೇ ಎಚ್ಚರದಿಂದಿರೋದು ಅಗತ್ಯ. ಮಾಸ್ಕ್ಗಳನ್ನ ಬಿಡುವುದು ಹಾಗೂ ಸಾರ್ವಜನಿಕ ಸ್ಥಳಗಳಲ್ಲಿ ಚುಂಬಿಸೋದ್ರಿಂದ ಕೋವಿಡ್ ಅಪಾಯವಿದೆ ಎಂದು ಹೇಳಿದ್ರು. ನಾವು ಧರಿಸುವ ಮಾಸ್ಕ್ನ ಮೇಲ್ಮೈ ಮೇಲೆ ವೈರಾಣುಗಳು ಅಂಟಿಕೊಂಡಿರುತ್ತವೆ. ಹೀಗಾಗಿ ಇನ್ನೊಬ್ಬರ ಮಾಸ್ಕ್ನ್ನು ಹತ್ತಿರದಿಂದ ಸಂಪರ್ಕಿಸೋದು ಬಹಳ ಗಂಭೀರ ಪರಿಣಾಮಕ್ಕೆ ನಾಂದಿ ಹಾಡಬಹುದು. ಹೀಗಾಗಿ ಮಾಸ್ಕ್ ಕಿಸ್ನ್ನು ಬಿಡೋದೇ ಒಳ್ಳೆಯದು ಎಂದು ವೈದ್ಯೆ ಶೋಭಾ ಗುಪ್ತಾ ಸಲಹೆ ನೀಡಿದ್ದಾರೆ. | kannad |
# old_scripts
There are some my old scripts.
cPanel folder - cPanel shared servers related scripts
crtfile_check.py - check HTTPS certificates for correct CA chain
jabber_send.py - send messages to Jabber groupchat
roundup_2_glpi_py24.py - Copy users, tickets, messages, etc from Roundup ticket system to GLPI MySQL database directly. Had to rewrote it for Python version 2.4.
| code |
এনসিপি নেতা শরদ পাওয়ারের বাড়িতে হামলা নিয়ে ক্ষোভ প্রকাশ মুখ্যমন্ত্রীর বাড়ি ঘেরাও করে হামলা, এই নিয়ে কড়া নিন্দা করলেন মুখ্যমন্ত্রী মমতা বন্দ্যোপাধ্যায় দারুন রেগে গিয়ে কড়া নিন্দা করলেন তিনি, এমনকি টুইট করেও সেই নিন্দা প্রকাশ করেছেন তিনি এনসিপি নেতা শরদ পাওয়ারের বাড়িতে হামলা করা হয়েছে, যা নিয়েই এবার মুখ খুলেছেন তিনি হঠাত্ করে এমন ধরনের নিন্দনীয় একটি কাজ প্রবীণ নেতা শরদ পাওয়ার তার বাড়িতে এই ধরনের কার্যকলাপ সত্যিই নিন্দনীয় এই বিষয় নিয়ে মুখে বলেছেন, সাথে টুইট পর্যন্ত করেছেন তিনি শরদ পাওয়ার একজন দেশের প্রবীণ জনপ্রতিনিধি তার বাড়িতে হামলা নিয়ে আমি নিন্দা করছি এই নিয়ে মহারাষ্ট্রের সরকারের বিবৃতিকে আমি স্বাগত জানাচ্ছি তবে এই ঘেরাও করে কে? জানা যায় মহারাষ্ট্র স্টেট রোড ট্রান্সপোর্ট কর্পোরেশনের কর্মীরা এই বাড়ি ঘেরাও করে এমনকি কাঁচের জানালা পর্যন্ত ভাঙা হয় দক্ষিণ মুম্বাইয়ের বাড়িতে এই কাজ করা হয় যা নিয়ে রাজনৈতিক দের একাংশ নিন্দা করেছেন অভিযোগ ওঠে ইট ছুড়ে নাকি জানালার কাঁচ পর্যন্ত ভেঙে দেওয়া হয় | bengali |
ಮಂಗಳೂರು : ವೃದ್ಧೆಯ ಚಿನ್ನಾಭರಣ ಕಳವು ರಿಕ್ಷಾ ಚಾಲಕ ಬಂಧನ ಮಂಗಳೂರು, ಆ.19: ವೃದ್ಧೆಯೊಬ್ಬರಿಗೆ ಸಹಾಯ ಮಾಡುವ ನೆಪದಲ್ಲಿ ಚಿನ್ನಾಭರಣ ಕಳವು ಮಾಡಿದ್ದ ಆರೋಪದಲ್ಲಿ ರಿಕ್ಷಾ ಚಾಲಕನೋರ್ವ ನನ್ನು ಉರ್ವ ಪೊಲೀಸರು ಬುಧವಾರ ಬಂಧಿಸಿ, ಲಕ್ಷಾಂತರ ರೂ. ಮೌಲ್ಯದ ಚಿನ್ನಾಭರಣ ವಶಕ್ಕೆ ಪಡೆದಿದ್ದಾರೆ. ಶಕ್ತಿನಗರ ನಿವಾಸಿ ಪ್ರವೀಣ್ ರಾಮನಾಯ್ಕಿ 40 ಬಂಧಿತ ಆರೋಪಿ. ವೃತ್ತಿಯಲ್ಲಿ ಈತ ರಿಕ್ಷಾ ಚಾಲಕ ಎಂದು ತಿಳಿದು ಬಂದಿದೆ. ಜೂ.7ರಂದು ಚಿಲಿಂಬಿಯ ದೇವಸ್ಥಾನವೊಂದರ ಬಳಿ 72 ವರ್ಷದ ವೃದ್ಧೆಗೆ ಸಹಾಯ ಮಾಡುವ ನೆಪದಲ್ಲಿ ಈತ ಚಿನ್ನಾಭರಣ ಕಳವುಗೈದು ಪರಾರಿಯಾಗಿದ್ದ ಎಂದು ಉರ್ವ ಠಾಣೆಯಲ್ಲಿ ಪ್ರಕರಣ ದಾಖಲಿಸಲಾಗಿತ್ತು. ಪ್ರಕರಣವನ್ನು ಭೇದಿಸಿದ ಪೊಲೀಸರು, ಆರೋಪಿಯನ್ನು ಬಂಧಿಸಿ ಆತನಿಂದ 4.32 ಲಕ್ಷ ರೂ. ಮೌಲ್ಯದ ಚಿನ್ನಾಭರಣವನ್ನು ಸ್ವಾಧೀನಪಡಿಸಿಕೊಂಡಿದ್ದಾರೆ. ಈ ಚಿನ್ನಾಭರಣವನ್ನು ಫಳ್ನೀರ್ನಲ್ಲಿನ ಬ್ಯಾಂಕ್ವೊಂದರಲ್ಲಿ ಅಡಮಾನ ಇರಿಸಿದ್ದ ಎಂದು ಪೊಲೀಸರು ತಿಳಿಸಿದ್ದಾರೆ. ಉರ್ವ ಠಾಣೆಯ ಪೊಲೀಸ್ ನಿರೀಕ್ಷಕ ಮುಹಮ್ಮದ್ ಶರೀಫ್ ನೇತೃತ್ವದಲ್ಲಿ ನಡೆದ ಕಾರ್ಯಾಚರಣೆಯಲ್ಲಿ ಪಿಎಸ್ಸೈ ಶ್ರೀಕಲಾ, ಎಎಸ್ಸೈ ಬಾಲಕೃಷ್ಣ, ಸಿಬ್ಬಂದಿಯಾದ ಪ್ರಕಾಶ್, ಬಸವರಾಜ್ ಬಿರಾದಾರ್ ಪಾಲ್ಗೊಂಡಿದ್ದರು. | kannad |
Today is the day everybody! The Strings of the Violin is officially out with Prizm Books! I am ridiculously excited about this. I have been waiting for today for what feels like a lifetime. What does today hold? Well, today holds chances to win free stuff like tote bags, shirts, and a free autographed copy of the book itself! How do you win that stuff? Well, here's the great part, you go to my Facebook page here and like today's posts. A random number generator will then pick you out and you will be told what you got!
Today is the culmination of an attempt at self-publishing, editing, frustration, and ultimately what feels like almost giving up before this book found its new home. I am eternally grateful to the great people at Prizm who found my book and gave it new life with my fantastic editor Jessica. I hope you guys like what was done to it. I know that I could not be happier with what was accomplished with this novel, and I can not wait to send along the other books in the series so that you guys can read more about Carrie and her adventures in Hadariah.
As for the book itself, right now it can be purchased through their website which is right here! Please do go and check it out! Other buy links will be along shortly.
So, take part in the excitement of today, and good luck with the draws! | english |
ભોપાલમાં એમેઝોનના સેલ પર, એફઆઈઆર દાખલ કરી ભોપાલ, નવી દિલ્હી, 26 જાન્યુઆરી હિ.સ. એમેઝોનના સેલ સામે, દેશના રાષ્ટ્રીય ધ્વજ ત્રિરંગાનો દુરુપયોગ કરવા બદલ કેસ દાખલ કરવામાં આવ્યો છે. મધ્ય પ્રદેશની રાજધાની ભોપાલમાં એમેઝોનના પ્લેટફોર્મ પર, ત્રિરંગા પ્રિન્ટેડ શૂઝ વેચવાનો મામલો સામે આવ્યો છે.હબીબગંજના રહેવાસી શુભમ નાયડુએ, ક્રાઈમ બ્રાન્ચ પોલીસ સ્ટેશનમાં એમેઝોન કંપનીના વેન્ડર સામે એફઆઈઆર નોંધાવી છે. ફરિયાદી નાયડુ ખાનગી કંપનીમાં નોકરી કરે છે. એમેઝોનના ઓનલાઈન પ્લેટફોર્મ પર રિપબ્લિક ડેના અવસર પર, સેલની જાહેરાત કરવામાં આવી હતી. પરંતુ સેલ સાથે રાષ્ટ્રધ્વજ છપાયેલ જૂતાનો ફોટો ચોંટાડવામાં આવ્યો હતો. ત્યારપછી રાજ્યના ગૃહમંત્રી નરોત્તમ મિશ્રાએ, આ મામલે કંપની વિરુદ્ધ કાર્યવાહી કરવાનો નિર્દેશ આપ્યો હતો. એમેઝોન અંગે ગૃહમંત્રીએ કરેલા આક્ષેપો દુઃખદાયક છે અને તેને સહન કરવામાં આવશે નહીં. તેમણે કહ્યું કે, પોલીસ આ અંગે યોગ્ય કાર્યવાહી કરશે.હિન્દુસ્થાન સમાચાર | gujurati |
بحرانی صورتحال میں معاملہ افہام تفہیم سے حل کرانے کی ذمہ داری انضمام الحق اور سبحان احمد کے سپرد فوٹو فائل لاہورکپتانی کا میوزیکل چیئر گیم بورڈکے گلے پڑنے لگا ون ڈے ٹیم کیلیے غیرموزوں ہونے کے باوجود منصب پر فائز ہونے والے اظہر علی نے انگلینڈ میں شکستوں پر قربانی کا بکرا بننے سے انکار کر دیا تفصیلات کے مطابق محدود اوورز کی کرکٹ کیلیے غیر موزوں خیال کرتے ہوئے اظہر علی کو گذشتہ سال ورلڈ کپ اسکواڈ میں شامل کرنے سے ہی گریز کیا گیا مگر پاکستان کا سفر کوارٹر فائنل میں تمام ہونے کے بعد مصباح الحق کی جگہ انھیں ون ڈے ٹیم کا کپتان مقرر کرنے کا حیرت انگیز فیصلہ سامنے اگیا انھوں نے 23 میچز میں قیادت کے فرائض سرانجام دیے جس میں سے 15 میں گرین شرٹس کو ناکامی کا منہ دیکھنا پڑا جبکہ میں کامیابی ملیانگلینڈ کیخلاف سیریز کے ابتدائی چاروں میچز میں شکست کے بعد اظہر علی کیلیے خطرے کی گھنٹیاں بجنا شروع ہوگئی تھیں چیئرمین پی سی بی شہریارخان نے بھی کپتان کی تبدیلی پر غور اور جلدکوئی فیصلہ کرنے کا بیان دیا تو واضح ہوگیا کہ کوئی کھچڑی ضرور پکائی جا رہی ہےذرائع کے مطابق بورڈ چاہتا تھا کہ اظہر کو خود قیادت سے دستبردار کرا لیا جائے تاکہ انھیں کپتان بنانے کی اپنی غلطی پر پردہ ڈالا جا سکےانگلینڈ سے سیریز کے اخری ون ڈے میچ کے بعد اظہر علی کی ہیڈ کوچ مکی ارتھر سے گھنٹے طویل ملاقات ہوئی 3روز قبل انھیں شہریار خان نے رضاکارانہ طور پر قیادت چھوڑنے کی ہدایت دی بورڈ کی جانب سے تذبذب کا شکار اظہر علی کو یقین دلانے کی کوشش ہوئی کہ بطور کھلاڑی انھیں ون ڈے اسکواڈ میں برقرار رکھا جائے گا ذرائع کے مطابق پی سی بی نے سلیکشن کمیٹی کے ساتھ مل کر مستقبل کا پلان بنایا جس کے تحت اظہر علی کو بتدریج ون ڈے ٹیم سے الگ کر دیا جاتا حکام کا خیال تھا کہ وہ تسلسل کے ساتھ رنز تو کرتے لیکن اسٹرائیک ریٹ کم ہونے کی وجہ سے بعد میں انے والے دیگر بیٹسمین دبا محسوس کرتے ہوئے مشکلات سے دوچار ہوجاتے ہیں ان کے پاس جدید انداز میں بیٹنگ کیلیے اسٹروکس ہی نہیں ہیں وہ ٹیسٹ کرکٹ کے اچھے کھلاڑی ہیں انھیں صرف اسی فارمیٹ پر توجہ دینا چاہیے ان کا خلا پرکرنے کیلیے سرفراز احمد کا موزوں اپشن بھی موجود ہے ان دنوں برطانیہ میں ہی موجود اظہر علی نے سارا ملبہ اپنے اوپر گرتے دیکھ کر ارادہ بدل دیا انھوں نے گذشتہ روز چیئرمین پی سی بی سے دوبارہ رابطہ کرتے ہوئے قیادت سے دستبردار ہونے سے انکار کردیاذرائع کا کہنا ہے کہ اس بحرانی صورتحال میں معاملہ چیف سلیکٹر انضمام الحق اور بورڈ کے چیف اپریٹنگ افیسر سبحان احمد کے سپرد کردیا گیا ہے دونوں مسئلہ افہام تفہیم سے حل کرانے کی کوشش کرینگے اظہر علی کی وطن واپسی 10ستمبر کو شیڈول ہے سلیکشن کمیٹی کو ویسٹ انڈیز سے27ستمبر کو یواے ای میں شروع ہونے والی سیریز کیلیے تینوں فارمیٹ کے اسکواڈز منتخب کرنا ہیں ون ڈے ٹیم کے سلسلے میں مشاورت کیلیے کپتان کا تقرر ضروری ہے مہمان کیریبیئن ٹیم کے ساتھ 33 ٹوئنٹی20ون ڈے اور ٹیسٹ میچز ستمبر اکتوبراور نومبر میں کھیلے جائیں گے ملتان میں موجود سلیکشن کمیٹی کے ارکان نے کھلاڑیوں کے انتخاب کیلیے مشاورت شروع کردی ہے انگلینڈسے سیریزمیں ٹیم کی کارکردگی کا بھی جائزہ لیاگیا ذرائع کے مطابق ڈومیسٹک کرکٹ میں عمدہ کارکردگی دکھانے والے عمراکمل سلمان بٹسعیداجمل اور کامران اکمل کی شمولیت پرتبادلہ خیال کیا گیاقومی ٹوئنٹی 20 ٹورنامنٹ کے راولپنڈی میں ہونے والے پہلے مرحلے میں کمر کی تکلیف کا شکار ہونے والے احمد شہزاد کو زیر غور نہیں لایا جا رہا اوپنر کی فارم اور فٹنس پر سوالیہ نشان ہونے کی وجہ سے کوئی خطرہ مول لینے سے گریز کیا جائے گا چیف سلیکٹر انضمام الحق جمعے کو ملتان پہنچ جائیں گے جس کے بعد ابتدائی فہرستیں مرتب کرلی جائیں گیمحدود اوورز کی کرکٹ کیلیے اسکواڈز کا اعلان عید کے بعد متوقع ہے | urdu |
రింగ్ మాస్టర్ సన్నీ: సోలో పర్ఫామెన్స్ ఇరగదీసేశాడుగా.! సండే ఫన్ డే అంటూ హౌస్ మేట్స్ని ఫుల్గా ఆడించి, పాడించి, నవ్వించి చివరికి ఎవరో ఒకరిని హౌస్ నుంచి బయటికి పంపించేస్తాడు బిగ్ బాస్ హోస్ట్ నాగార్జున. ఇక తర్వాత మండే. సోమవారం వచ్చిందంటే చాలు, ఎలిమినేషన్ కోసం నామినేషన్ల పర్వం మొదలవుతుంది. అంత వరకూ ఆనందంగా ఉన్న హౌస్ మేట్స్ ఒక్కసారిగా అపరిచితులుగా మారిపోతారు. ఒకరి మీద ఒకరు ఎక్కడ లేని గ్లడ్జ్లను బయటికి తీసి సుత్తి సుత్తి కారణాలతో నామినేట్ చేసి పారేస్తుంటారు. అయితే, ఈ వారరం నామినేషన్ల పర్వం కాస్త డిఫరెంట్గా జరిగింది. అంతా సన్ని కనుసన్నల్లో జరిగింది. దాదాపు ఈ వారం నామినేషన్లలో ఉన్నవారంతా సన్నీ డెసిషన్ మీద నామినేట్ అయినవారే. దాంతో, సోమవారానికి సన్నీ బిగ్బాస్ హీరో అయిపోయాడు. రింగ్ మాస్టర్గా మారి, టోటల్ హౌస్ని తన చేతుల్లోకి తీసేసుకుని దడదడలాడించేశాడు. శ్వేత వర్మ హౌస్ నుండి బయటికి వెళ్లడానికి కారణం యాంకర్ రవి అన్న ఆరోపణతో రవిని నామినేట్ చేశాడు సన్నీ, అలాగే కాజల్ అగర్వాల్, ప్రియ, సిరి, జశ్వంత్, శ్రీరామ్ చంద్ర, యానీ మాస్టర్ ఇలా అందరి నామినేషన్లలోనూ ప్రత్యక్షంగా, పరోక్షంగా సన్నీ హస్తం ఉంది. ఇక సీక్రెట్ రూమ్లో ఉన్న లోబో ఆటోమెటిగ్గా నామినేట్ అయిన సంగతి తెలిసిందే. | telegu |
পুরীর বাহুবলী তকমা পেয়েছেন অনিল, জগন্নাথ দেবের রথ টানতে তিনিই থাকেন সবার আগে, রইলো আসল পরিচয় একেবারে বাহুবলি ছবির সেই দৃশ্য, যা এবার বাস্তবে ভেসে উঠলো বাহুবলি ছবি আমরা সবাই দেখেছি, এস এস রাজামৌলি পরিচালিত বাহুবলি ছবির প্রথম ভাগে দেখা যাচ্ছে বাহুবলী নিজেই তার মূর্তিকে মাটি থেকে তুলে দাঁড় করাচ্ছে , দড়িতে টান দিয়েঠিক এমন ভাবেই বাস্তবের বাহুবলির একটি ছবি ভাইরাল হয়ে যায় সোশ্যাল মিডিয়ায় যেখানে দেখা যায় পুরীর রথের দড়ি টানতে বিশাল মাংসপেশির যুক্ত শক্তিধর বাস্তবের বাহুবলী, পুরীর রথের দড়িতে টান দিতেই গড়গড়িয়ে এগিয়ে যাচ্ছে রথ, আর বাস্তবের এই দৃশ্য দেখে অভিভূত হয় সবাই সোশ্যাল মিডিয়ায় ছড়িয়ে পড়া ছবি, যা নিমিষের মধ্যেই বিখ্যাত করে দেয় পুরীর সেবায়েত অনিল গোচিকারকে, বয়স তার ৪৩ বছর সেই দৃশ্য দারুণভাবে আকর্ষিত করে সাধারণ মানুষকে, সেই সেবায়েতের মাঝেই খুঁজে পায় মানুষ ছবির বাহুবলিকে, আর ঠিক তারপর থেকেই সেই সেবায়েত হয়ে ওঠেন পুরীর বাহুবলী তিনি প্রথম থেকেই জগন্নাথ মন্দির এর সাথে যুক্ত, কারণ তিনি পুরীর জগন্নাথ দেবের ব্যক্তিগত দেহরক্ষী সম্প্রতি তিনি হয়তো জনপ্রিয়তা পেয়েছেন, কিন্তু তাঁর এই কঠোর পরিশ্রম ও শরীরচর্চা চলে আসছে বহুদিন থেকেই শুধু অনিল নয়, তাদের সমস্ত পরিবারই দীর্ঘদিন ধরেই পুরীর জগন্নাথ মন্দিরের সেবায়েত জানা গিয়েছে,বহু প্রজন্ম থেকেই তারা পুরীর জগন্নাথ মন্দিরের সেবায়েত ও দেহরক্ষী হিসেবে কাজ করছে এরা মন্দিরের ভিতরে থেকে দেবতার সেবা করেন, তাই এদের বলা হয় প্রতিহারী অনিল কে শুধু দেবতার দেহরক্ষী বললেই বলা হবে না, কারণ তিনি একজন পেশাদার বডিবিল্ডার ন্যাশনাল ও্য ইন্টারন্যাশনাল বডিবিল্ডিং চ্যাম্পিয়নও সাত বার মিস্টার ওড়িশার খেতাব পেয়েছেন ২০১২ সালে মিস্টার ইন্ডিয়া হন অনিল তারপর ২০১৪ সালে বিশ্ব চ্যাম্পিয়নশিপে ব্রোঞ্জ এবং ২০১৬ সালে দুবাইয়ে আয়োজিত আন্তর্জাতিক দেহসৌষ্ঠব প্রতিযোগিতায় সোনা জিতেছিলেন অনিল পুরীর জগন্নাথদেবের বডিগার্ড থাকতে হলে, হৃষ্টপুষ্ট বডি বিল্ডার হতে হবে এর কোন মানে নেই , সাধারণ হলেও বডিগার্ড হওয়া সম্ভবতবে অনিল বডি বিল্ডিং করার অনুপ্রেরণা পেয়েছেন তার নিজের দাদার কাছ থেকে তার দাদা আখড়ায় মুগুর ভাজতেন, আর সেই থেকেই অনুপ্রেরণা নিয়ে গত ১০ বছর থেকে তিনি শরীরীচর্চা করছেন অতিমারীর সময় পুরীর জগন্নাথ দেবের রথের দড়িতে টান দিয়ে তিনি এখন পুরীর বাহুবলী | bengali |
using Jose;
using Org.BouncyCastle.Crypto.Parameters;
using System;
using System.Collections.Generic;
using System.IO;
using System.Text;
namespace vindpro.firebase.shared
{
class Firebasetoken
{
public static string firebasePrivateKey = @"-----BEGIN PRIVATE KEY-----\nREPLACE_ME\n-----END PRIVATE KEY-----\n";
// Same for everyone
public static string firebasePayloadAUD = "https://identitytoolkit.googleapis.com/google.identity.identitytoolkit.v1.IdentityToolkit";
// client_email from the Service Account JSON file
public static string firebasePayloadISS = "REPLACE_ME.iam.gserviceaccount.com";
public static string firebasePayloadSUB = "REPLACE_ME.iam.gserviceaccount.com";
// the token 'exp' - max 3600 seconds - see https://firebase.google.com/docs/auth/server/create-custom-tokens
public static int firebaseTokenExpirySecs = 3600;
private static RsaPrivateCrtKeyParameters _rsaParams;
private static object _rsaParamsLocker = new object();
public static string EncodeToken(string uid, Dictionary<string, object> claims)
{
// Get the RsaPrivateCrtKeyParameters if we haven't already determined them
if (_rsaParams == null)
{
lock (_rsaParamsLocker)
{
if (_rsaParams == null)
{
StreamReader sr = new StreamReader(GenerateStreamFromString(firebasePrivateKey.Replace(@"\n", "\n")));
var pr = new Org.BouncyCastle.OpenSsl.PemReader(sr);
_rsaParams = (RsaPrivateCrtKeyParameters)pr.ReadObject();
}
}
}
var payload = new Dictionary<string, object> {
{"claims", claims}
,{"uid", uid}
,{"iat", SecondsSinceEpoch(DateTime.UtcNow)}
,{"exp", SecondsSinceEpoch(DateTime.UtcNow.AddSeconds(firebaseTokenExpirySecs))}
,{"aud", firebasePayloadAUD}
,{"iss", firebasePayloadISS}
,{"sub", firebasePayloadSUB}
};
return Jose.JWT.Encode(payload, Org.BouncyCastle.Security.DotNetUtilities.ToRSA(_rsaParams), JwsAlgorithm.RS256);
}
private static long SecondsSinceEpoch(DateTime dt)
{
TimeSpan t = dt - new DateTime(1970, 1, 1);
return (long)t.TotalSeconds;
}
private static Stream GenerateStreamFromString(string s)
{
MemoryStream stream = new MemoryStream();
StreamWriter writer = new StreamWriter(stream);
writer.Write(s);
writer.Flush();
stream.Position = 0;
return stream;
}
}
}
| code |
Nora Fatehi: নোরার ইনস্টাগ্রাম হ্যাকের চেষ্টা, তাই কি সাময়িক বিরতি অভিনেত্রীর? শুক্রবার কিছুক্ষণের জন্য সোশ্যাল মিডিয়া থেকে বেরিয়ে গিয়েছিলেন নোরা ফাতেহি অনুরাগীদের সে কী দুঃখ! কিছুক্ষণের বিরতির পর ফের ফিরে এসেছেন খুসু খুসু গার্ল কিন্তু কিছুক্ষণের জন্যে হলেও কেন সোশ্যাল মিডিয়া থেকে বেরিয়ে গিয়েছিলেন নোরা? ইনস্টাগ্রাম স্টোরিতে লিখেছেন নোরা নিজেই তিনি বলেছেন, সকলকে সরি আমার ইনস্টাগ্রাম অ্যাকাউন্ট হ্যাক করার চেষ্টা চলছিল সকাল থেকে কোনও এক ব্যক্তি আমার অ্যাকাউন্টে ঢোকার চেষ্টা করছিল ইনস্টাগ্রাম টিমকে আমি অনেক অনেক ধন্যবাদ জানাতে চাই ওঁরাই সব সমস্যার সমাধান করেছেন ইনস্টাগ্রামে ৩৬.৭ মিলিয়ান ফলোয়ার রয়েছে নোরার বায়ো প্রোফাইলে নিজেকে অভিনেত্রী, পারফর্মার, গায়িকা, সেল্ফ টট ডান্সার, প্রযোজকের পরিচয় দিয়েছেন সম্প্রতি দুবাইয়ের অ্যানিম্যাল রিসার্ভের সফরে গিয়েছিলেন নোরা সোশ্যাল মিডিয়ায় ছবি পোস্ট করেছেন নোরা সেখানে দুই সিংহর সঙ্গে ছবি পোস্ট করেছেন তিনি তাদের খাইয়ে দিতেও দেখা যাচ্ছে অভিনেত্রীকে নির্দিষ্ট পদ্ধতি মেনে সিংহদের খাওয়াচ্ছিলেন নোরা লিখেছেন, খুব ভয়ের ব্যাপার কিন্তু মাসুদকে ধন্যবাদ ওর টিম আমাকে এই সুযোগ করে দিয়েছে সিংহের মতো সুন্দর এক প্রাণীর সামনে যেতে পেরে আমি খুশি এই প্রাণীদের প্রতিকূল পরিস্থিতি থেকে উদ্ধার করেছেন তাঁরা দারুণ কাজ করছেন স্বর্গীয় অনুভূতি হয়েছে আমার সারাজীবন মনে রাখতে চাই দুবাই ভ্রমণের আরও অনেক ঝলক নোরা শেয়ার করেছেন সোশ্যাল মিডিয়ায় সেখানকার পুলটাইমের ছবি শেয়ার করেছেন নোরা একটিতে হায়নাকে বোতলে দুধ খাওয়াতেও দেখা যায় অভিনেত্রীকে শিম্পাঞ্জির সঙ্গে কিসিং ভঙ্গিতে ছবিও তুলেছেন তিনি সম্প্রতি গুরু রানধাওয়ার ডান্স মেরি রানি মিউজ়িক ভিডিয়োতে দেখা যায় নোরাকে সারা মাথায় সোনালি কোঁকড়ানো চুল ছিল নোরার অনেকে তাঁর লুক শাকিরার সঙ্গে তুলনা করেছেন আরও পড়ুন: Saraswati Puja 2022Indrani Haldar: হলুদ মেখে স্নান, পুজোর আগে কুল খাওয়া কেন মানা, অন্য কারণ বললেন ইন্দ্রাণী হালদার আরও পড়ুন: Nora Fatehi: হঠাত্ই ইনস্টাগ্রাম থেকে উধাও হল নোরার অ্যাকাউন্ট! আরও পড়ুন: World Cancer DayAindrila SharmaSabyasachi Chowdhury: আমার যখন চুল উঠে টাক হয়েছিল, সব্যসাচী সেই টাকেই চুমু খেত. | bengali |
കൊക്കയാറില് കണ്ണീര് കാഴ്ച്ച, മണ്ണില് പുതഞ്ഞ് മൃതദേഹങ്ങള്, 3 കുട്ടികളുടെ മൃതദേഹം കണ്ടെത്തി,തെരച്ചില് തുടരുന്നു ഇടുക്കി: കൊക്കയാറിലെ ഉരുള്പൊട്ടലില് landslide കാണാതായവരില് മൂന്ന് കുട്ടികളുടെ മൃതദേഹങ്ങള് കണ്ടെത്തി. അഫ്ന ഫൈസല് 8, അഫിയാന് ഫൈസല് 4, അംന 7 എന്നിവരുടെ മൃതദേഹങ്ങളാണ് കണ്ടെത്തിയത്. മൃതദേഹങ്ങള് പൂര്ണ്ണമായി മണ്ണില് പൊതിഞ്ഞ് കിടക്കുന്ന നിലയിലായിരുന്നു. ജെസിബി ഉപയോഗിച്ച് മണ്ണ് നീക്കം ചെയ്ത് പരിശോധിക്കുന്നതിന് ഇടയിലാണ് മൃതദേഹങ്ങള് കണ്ടെത്തിയത്. രാവിലെ ഏഴുമണി മുതല് എന്ഡിആര്എഫും പൊലീസും പ്രദേശത്ത് തിരച്ചില് നടത്തുകയാണ്. ഇനി അഞ്ചുപേരെയാണ് ഇവിടെ കണ്ടെത്താനുള്ളത്. കൊക്കയാര് പഞ്ചായത്തിന് സമീപം ഒഴിക്കില്പ്പെട്ട് കാണാതായ ആന്സി എന്ന വീട്ടമ്മയെയും കണ്ടെത്താന് കഴിഞ്ഞിട്ടില്ല. അതേസമയം പെരുവന്താനം നിര്മലഗിരിയില് മലവെള്ളപാച്ചിലില് കാണാതായ ആളുടെ മൃതദേഹം കണ്ടെത്തി. വടശ്ശേരിയില് ജോജോയുടെ മൃതദേഹമാണ് കണ്ടെത്തിയത്. വീടിന് സമീപത്തെ മണ്ണും ചെളിയും നീക്കം ചെയ്യുന്നതിനിടെയാണ് ജോജോ മലവെള്ളപാച്ചിലില്പ്പെട്ടത്. മൃതദേഹം കാഞ്ഞിരപ്പള്ളി ജനറല് ആശുപത്രിയില് സൂക്ഷിച്ചിരിക്കുകയാണ്. മഴയുടെ ശക്തി കുറഞ്ഞെങ്കിലും തിരുവനന്തപുരം മുതല് കോഴിക്കോട് വരെയുള്ള 11 ജില്ലകളില് യെല്ലോ അലര്ട്ട് പ്രഖ്യാപിച്ചിട്ടുണ്ട്. ചുരുങ്ങിയ സമയത്തില് തോരാതെ പെയ്ത് വലിയ നാശനഷ്ടങ്ങള് ഉണ്ടാക്കുന്ന പെരുമഴയ്ക്ക് കാരണം ലഘുമേഘ വിസ്ഫോടനമാണെന്നാണ് വിലയിരുത്തല്. അസാധാരണമായി രൂപംകൊള്ളുന്ന മേഘകൂമ്ബാരങ്ങളാണ് പലയിടത്തും രണ്ട് മണിക്കൂറില് അഞ്ച് സെന്റിമീറ്ററിലധികം തീവ്രമഴയായി പെയ്തിറങ്ങിയത്. | malyali |
Tag Archive | "sims iphone"
Excuse me, can you two leave so I can get back to fishing?
The Sims and I go way back. If you’re not familiar with the game’s concept it’s essentially like playing with a virtual Barbie dolls. You control a Sim and help them navigate through the world by helping them conquer everything from eating, sleeping and basic hygiene to climbing a career ladder and finding true happiness with another Sim. Or multiple Sims!
If you’ve played the regular version computer version of The Sims you know how graphics intensive it is. Everything is fully 3D rendered, able to be manipulated and/or altered. It’s a huge game with a heavy draw time so I was dubious about how it would work on the iPhone.
To my surprise, it’s actually quite nimble. The designers have done a good job giving detail to what you want to see and scaling back on what is not necessary for close up detail. For example, when your Sim walks through the town, your icon is reduced to a small blue figure against a 2D background. This helps with navigation and load times.
As with any of these types of games, the first step is the creation of your Sim. You pick the gender, hairstyle, clothes and personality. Be careful about the styles you pick here because unlike the full version of the game, you cannot change these later. You’ll be stuck with that outfit the whole game!
The basic needs of your Sim are displayed for you in the bottom left of the screen. Touch the green bar and you’ll be shown the current status of each need. Hungry? Tired? Bored? Lonely? It’s up to you to take care of your Sim! Interaction with objects is very intuitive. Touch the bed and select the option to sleep. Click on the TV to watch and get some good wholesome entertainment.
Once you’ve mastered the basics of caring for your Sim you’ll find you have another need – money! You need a job! You can find a job by picking up the phone or going into town. I started out in the restaurant as a cook. Don’t be afraid to wandering around and see what appeals to you. Once you’ve got your job, make sure you note the days of the week you work and what hours. You don’t want to be late!
Getting around quickly – You can’t go to work until 30 minutes before your start time. But once it’s time, the quickest way to get to work is to use the Diamond button in the lower right hand corner. Click on the Diamond and then the button that looks like a desk. This will take you to work instantly. This also works for getting home quickly by selecting the button that looks like a house.
Cooking – Interested in improving your cooking skills? Go the restaurant in town and purchase a recipe or two. Click on the Diamond icon and scroll to the inventory page. Scroll down to the bottom and you’ll see your recipes! You’ll also see if you have the ingredients to make that meal! Need breed and cheese for the grilled cheese sandwich? Head to the Quickmart! Once you have all the ingredients you need to cook the recipe head home and click on the stove. Choose the recipe you want to cook and a minigame starts. Pots on a stove must be picked up and shaken as they start to glow red to help them cool down. You must shake your iPhone or iTouch to shake the pots. You must then touch the next pot to shake and cool it.
Fishing – Once you’ve purchased a fishing rod from the Hobby store you can head to the Lake and start fishing. The fish will appear in the water and you’ll need to tilt the device gently to get the line in front of the fish. Eventually the fish will be hooked and a green fish hook icon will appear in the water. Quick jerk the iPhone or iTouch to catch the fish and reel it in.
Money, money, money – There are lots of ways to make money in the game besides your job!
-Be sure to meet everyone in the town because many have ‘quests’ that will earn you good money. Walter would like a trout. Kia needs a catfish. Marcelle pays for an egg.
– Fishing in the lake is an amazingly easy way to earn money. Catch the fish and then sell them back to the Quickmart.
– Find out who your boss is (Diamond icon and then scroll to your job panel) and make friends with them. Eventually you’ll get the option to ask them for a raise!
– Once you’ve upgraded your home you’ll get a backyard garden! Grown seeds purchased at the Hobby store and sell the extras back to the Quickmart.
Woohoo – If you want your Sim to be intimate with another Sim you need to choose the Romantic options when talking. It starts with a flirt, then a pick up line, a tender embrace and then a hot smooch. But where’s the woohoo? Scroll up the options and it should be the last option in the Romance – if your Sim is into you!
The gameplay is snappy and the graphics are very smooth and beautiful. The ambient sound was pleasant and soothing. I enjoyed exploring the town, meeting the different Sims and improving my Sim’s life. It’s strangely addictive, just like the full version of Sims.
The original version spoils you with the amount of choices allowed. Because of the limitations of the iPhone/iTouch sacrifices had to be made. No changing hairstyles, no changing clothes, furniture upgrades are limited, and no real interaction with other Sims that changes you. By that I mean you can’t move in with your spouse, can’t have children nor do you age.
I had a lot of fun playing this game and I’m going to keep playing it. If you’re a fan of the original Sims I think you’ll enjoy this scaled down version. It’s beautifully rendered and there’s a lot of fun to be had with this game. I look forward to their next offerings! | english |
Never one to leave his opinion unnoted, director James Cameron offered up his viewpoints on James Wan’s Aquaman, praising the DC blockbuster while also throwing shade at the project.
Speaking with Yahoo Entertainment, Cameron discusses the fake Aquaman movie the director helmed on HBO’s Entourage. Cameron starred as himself in a recurring role during the second and third seasons of the series where he directed Adrian Grenier’s Vincent Chase in his comic book movie. The Entourage version of Aquaman also starred Mandy Moore as Aquagirl, Ray Liotta and Sharon Stone as Aquaman’s parents, and James Woods as the villain Abaddon. In the show, Aquaman 2 swapped out Chase for Jake Gyllenhaal and was directed Michael Bay, so the story goes.
The director goes on to say that his experience as a deep-sea diver and “thousands of hours underwater” makes it hard for him to resonate with the film “because it doesn’t look real.” Cameron also told the outlet that his version of Aquaman would include more environmental activism, which he felt was lacking a bit in Wan’s movie.
“They did throw in a couple of things with whales and things like that to remind us that we are kind of using the ocean as a toilet and as a garbage dump. So I applaud the film for that,” Cameron added.
Cameron’s currently-in-production Avatar 2 is said to explore the underwater worlds of Pandora, so we will find out on December 18, 2020 if his own ocean epic matches up to Wan’s!
The post James Cameron Praises & Throws Shade at Aquaman appeared first on ComingSoon.net. | english |
மும்பை அணிக்கு விட்டு கொடுத்ததா பஞ்சாப்? மேட்ச் பார்ப்பவர்கள் முட்டாள்களா? நேற்று நடைபெற்ற மும்பை மற்றும் பஞ்சாப் அணிக்கு இடையிலான போட்டியில் மும்பை அணி வெற்றிபெற வேண்டும் என்பதற்காக பஞ்சாப் அணி வேண்டுமென்றே விட்டுக் கொடுப்பது போல் இருந்ததாக விமர்சகர்கள் சிலர் கடுமையாக கண்டனம் தெரிவித்து வருவது பெரும் பரபரப்பை ஏற்படுத்தி உள்ளது. நேற்றைய போட்டியில் முதலில் பேட்டிங் செய்த பஞ்சாப் அணியின் அடித்து ஆட வேண்டும் என்பதை மறந்து மிகவும் சுமாராகவே விளையாடியது. அந்த அணி 20 ஓவர்களில் 6 விக்கெட்டுகள் இழந்து வெறும் 136 ரன்கள் மட்டுமே எடுத்தது என்பது குறிப்பிடத்தக்கது. குறிப்பாக பஞ்சாப் அணியின் முக்கிய பேட்ஸ்மேனான கெயில் நேற்று ஓப்பனிங் பேட்ஸ்மேனாக களமிறக்கப்படாதது பெரும் சந்தேகத்தை ஏற்படுத்தியுள்ளது. நேற்றைய போட்டியில் பஞ்சாபின் மயங்க் அகர்வால் காயம் அடைந்ததால் விளையாடவில்லை என்பதால் அவருக்கு பதில் ஓப்பனிங் பேட்ஸ்மேனாக கிறிஸ் கெயில் களமிறக்கபடுவார் என்று அனைவரும் எதிர்பார்த்தனர். ஆனால் திடீரென மந்தீப் சிங் களமிறக்கப்பட்டார். அவர் பவர்பிளே ஓவரில் 14 பந்துகளுக்கு 15 ரன்கள் மட்டுமே அடித்து அவுட்டாகி வெளியேறினார். பவர் பிளேயில் கெயில் களமிறங்கியிருந்தால் மும்பை பந்துவீச்சாளர்களின் பந்துகளை வெளுத்து வாங்கி இருப்பார் என்பது குறிப்பிடத்தக்கது. அதேபோல் பந்து வீச்சிலும் பஞ்சாப் அணியினர் வேண்டுமென்றே சுமாராக பந்து வீசியது போல் தான் இருந்தது. ஹர்திக் பாண்டியாவுக்கு ஷமி வீசிய 19வது ஓவரில் இரண்டு பவுண்ட்ரிகள் மற்றும் ஒரு சிக்சர் என 16 ரன்கள் விட்டுக்கொடுத்து 20ஆவது வேலை இல்லாமல் செய்துவிட்டது என்பது பஞ்சாப் அணி விட்டுக்கொடுத்தது என்பதை உறுதி செய்வதாக விமர்சகர்கள் கண்டனம் தெரிவித்துள்ளனர் என்பது குறிப்பிடத்தக்கது. மும்பை அணி நேற்று தோல்வியடைந்திருந்தால் தொடரில் இருந்து விலகும் நிலை ஏற்பட்டிருக்கும். ஆனால் மும்பை அணி வெற்றி பெற வேண்டும் என்பதற்காகவே வேண்டுமென்றே பஞ்சாப் அணி விட்டுக் கொடுத்தது போல் தெரிந்ததாகவும் விமர்சகர்கள் கடுமையாக விமர்சனம் செய்து வருகின்றனர். ஐபிஎல் தொடரில் இதுவரை நடந்த அனைத்து போட்டிகளிலும் மும்பை அணி பிளே ஆப் சுற்றில் விளையாடிய நிலையில் இந்த தொடரில் பிளே ஆப் சுற்றுக்கு செல்லவில்லை என்ற பெரிய அவமதிப்பாக இருக்கும் என்பதால் மும்பை அணிக்கு பஞ்சாப் அணி விட்டுக் கொடுத்தது என்று கூறப்படுகிறது. கடைசி ஓவரில் 4 ரன் கூட எடுக்க விடாமல் தடுத்து நிறுத்தும் அளவுக்கு பந்துவீசும், ஐபிஎல் போட்டியில் கடைசி ஓவருக்கு முந்திய ஓவரிலேயே 16 ரன்களை ஷமி விட்டுக் கொடுக்கிறார் என்றால் கண்டிப்பாக இதில் ஏதோ பின்னணி இருக்கிறது என்றும் மேட்ச் பார்ப்பவர்களை ஐபிஎல் நிர்வாகத்தினர் முட்டாள் ஆக்குகின்றனர் என்றும் விமர்சகர்கள் கடுமையாக விமர்சனம் செய்து வருகின்றனர். | tamil |
لاہور نیوز رپورٹر پنجاب سول سیکرٹریٹ ایمپلائز ایسوسی ایشن کی حلف برداری کی تقریب دربار ہال سیکرٹریٹ میں ہوئی مہمان خصوصی ایڈیشنل چیف سیکرٹری پنجاب سہیل عامر تھے سٹیج سیکرٹری کے فرائض چودھری غلام غوث ایڈیشنل جنرل سیکرٹری پنجاب سول سیکرٹریٹ ایسوسی ایشن نے ادا کئے سپاسنامہ راجہ سہیل احمد سینئر نائب صدر پنجاب ایسوسی ایشن نے پیش کیا | urdu |
సూర్మరశ్మిని అడ్డుకుంటే కేసు.. రైట్ టు లైట్ యాక్ట్ దిశ, ఫీచర్స్ : యునైటెడ్ కింగ్డమ్ రాజధానిగా వెలుగొందుతున్న లండన్ మహానగరానికి రెండు వేల సంవత్సరాల చరిత్ర ఉంది. విస్తీర్ణపరంగా ప్రపంచంలోనే అతి పెద్ద నగరంగా విరాజిల్లుతోంది. ఇక్కడి అనేక పాత భవనాలు దేశ, విదేశీ సందర్శకులను అమితంగా ఆకట్టుకుంటాయి. అయితే వీటిలో కొన్ని పురాతన భవనాలను పరిశీలిస్తే.. వాటి కిటికీల దిగువన ఏన్షియంట్ లైట్స్ప్రాచీన లైట్లు అనే రాతలు కనిపిస్తుంటాయి. ఇవి అల్బేమార్లే వే, క్లెర్కెన్వెల్ రోడ్, చైనాటౌన్, కోవెంట్ గార్డెన్, న్యూమాన్ పాసేజ్, గుడ్జ్ స్ట్రీట్ వంటి ప్రాంతాల్లోనే ఎక్కువ. ఈ ట్రెండ్ లండన్లోనే కాక డోర్సెట్, కెంట్తో పాటు ఇంగ్లాండ్ అంతటా చాలాచోట్ల ఈ తరహా సంకేతాలను చూడవచ్చు. ఇంతకీ వాటికి అర్థమేమిటి? ఎందుకు అలా రాశారు? ఏన్షియంట్ లైట్స్ లేదా రైట్ టు లైట్ అనేది ఒక ఆంగ్ల ఆస్తి చట్టం. ఎవరైనా కొత్తగా ఇల్లు కట్టుకున్నప్పుడు ధారాళమైన వెలుతురు, గాలి వచ్చేలా కిటికీలను డిజైన్ చేస్తుంటారు. అయితే ఇటీవల కాలంలో ఐదారు అంతస్థులకు మించి భవన నిర్మాణాలు చేపడుతుండటంతో అవి సూర్యరశ్మికి అడ్డుగా నిలుస్తున్నాయి. దీన్ని దృష్టిలో పెట్టుకునే రైట్ టు లైట్ అనే చట్టం వచ్చింది. ఈ మేరకు 20 ఏళ్లుగా సెపరేట్గా కేటాయించిన కిటికీ నిరంతరాయంగా సూర్మరశ్మిని స్వీకరిస్తుంటే, ఆ ఇంటి యజమానులకు సహజమైన కాంతిని పొందే హక్కు లభిస్తుంది. ఒక వ్యక్తి ఏన్షియంట్ లైట్ హక్కును పొందిన తర్వాత, పక్కనే ఉన్న భూ యజమాని ఎత్తయిన భవనాన్ని లేదా గోడను నిర్మించడంచెట్లను ఎత్తుగా పెంచడం వంటివి చేయకూడదు. గతంలో కొందరు భవన యజమానులు ఈ విషయంలో తమకు ఆటంకం కలిగించినవారిపై కంప్లయింట్ చేసి న్యాయస్థానాల్లో గెలిచిన సందర్భాలున్నాయి. నిజానికి ఈ చట్టం 1663లో ఇంగ్లాండ్లో రూపొందగా, దాని ప్రస్తుత రూపం ప్రిస్క్రిప్షన్ యాక్ట్ 1832పై ఆధారపడి ఉంది. కాలిన్స్ డిక్షనరీ ఆఫ్ లా ప్రకారం ఒక భూయజమాని అంతకుముందులా కాంతిని స్వేచ్ఛగా, తగినంతగా ఆస్వాదించడం లేడని భావిస్తే పొరుగువారిని చట్టపరంగా సవాలు చేయవచ్చు. అయితే చట్టమైతే చేశారు కానీ ఆమోదయోగ్యమైన కాంతి స్థాయిలను నిష్పాక్షికంగా లెక్కించలేదు. అందుకు బదులుగా మానవజాతి సాధారణ భావనల ప్రకారం తగినంత కాంతి అని చట్టం స్పష్టం చేసింది. సాధారణంగా ఇంట్లో చదవడానికి, ఇతర పనుల కోసం వన్ ఫుట్ క్యాండిల్ ఆఫ్ ల్యుమినన్స్దాదాపు టెన్ లక్స్ అవసరమని రైట్ టు లైట్ ఎక్స్పర్ట్ మిస్టర్ పెర్సీ వాల్డ్రామ్ సూచించాడు. వాల్డ్రామ్ పద్ధతులు 1920ల నుంచి వాడుకలో ఉండగా.. ఇటీవల కాలంలో అవి చాలా విమర్శలకు గురయ్యాయి. | telegu |
The Ceann Comhaile says he saw nobody drunk during the abortion debate.
CEANN COMHAIRLE SEÁN Barrett says that the perception of the ‘Dáil bar’ is false and that he saw nobody drunk during the abortion debate.
Speaking on RTÉ’s Marian Finuncane programme this morning, the Ceann Comhairle said that it is a ‘members facility’ and is there to give deputies somewhere to go when the Dáil is not in session.
“It’s a place you can go, you can watch the news, you can watch television. You can have your lunch, you can have a snack, you can sit down and read the paper,” he said.
I’l tell you one of the best things about it, I’ve been there 30 years.You could have a stand- up row in the chamber, but once they leave that chamber and go there for a cup of coffee or whatever, next thing you see is them in there chatting with each other.
Barrett said that the increased difficulty in getting re-elected has mean that the “day is gone” when members could spend their time drinking in the house.
TheJournal.ie reported earlier this month that nearly €7,000 was spent in the Dáil bars on the night the of the abortion debate, €4,000 of this was spent on alcoholic drinks alone but Barrett said he saw no members drunk before the debate ended at 5am.
Email “'It's a members facility'. Ceann Comhairle denies Dáil bar is there for drinking”.
Feedback on “'It's a members facility'. Ceann Comhairle denies Dáil bar is there for drinking”. | english |
With the development of ZYTO biocommunication, it is easy to identify your body’s biological coherence for things relating to your health. Your first step to getting more out of life may be as close as a ZYTO scan.
1 – Insight into your health. Reports from your ZYTO scan provide you with information that may help identify your individual wellness needs. Identifying Virtual Items to which you have an unusual response may give you and your practitioner insight about wellness issues to keep you functioning at an optimal state.
2 – Identify your biological coherence for nutrition. Does one size fit all when it comes to nutritional support? Of course not! ZYTO scans identify your body’s unique responses. Knowing your biological coherence helps you and your practitioner choose the nutritional supplements that will support your individual health needs.
3 – Save Money. There are many good nutritional supplements but you probably don’t need them all. Knowing your biological coherence helps you to choose products that are right for you. Choosing well means your investment in supplements is more likely to pay off, providing you the benefits you need and saving money on things you don’t need.
4 – Increase Energy. Your body consumes energy in its effort to maintain a healthy balance. When your body uses this energy to deal with life’s extra challenges, like fighting a cold, you will have less energy to perform your day-to-day physical activities. ZYTO helps you to identify the additional support your body may need to maintain wellness and keep your energy levels high.
5 – Track your Health. ZYTO scans give you information ‘in the moment.’ Tracking your scans over time can be beneficial, allowing you to identify trends or long term patterns that you will want to pay particular attention to. Keeping track of your past can help you predict the future, and reviewing your past ZYTO reports gives you essentially a look back through time.
6 – Peace of Mind. Worrying about your health or the health of a loved one can be incredibly stressful. Sometimes it is hard to put into words what you are feeling, and then there is the added concern about things of which you may not consciously be aware. Biocommunication takes place at a subconscious level so you don’t have to worry about the words you choose to describe what you are feeling.
ZYTO scan reports introduce a new perspective about your unique biological coherence, enabling a more complete picture to base wellness decisions. Knowing more about your individual health can make all the difference… giving you an added measure of peace.
The ZYTO Compass uses Galvanic Skin Response (GSR) to determine your biological coherence for virtual items representing specific nutritional products, oils, and supplements. This information helps you make better decisions about which wellness products to purchase and use.
stimuli are sent to the body and the Hand Cradle measures your body’s GSR.
The Compass software analyzes the GSR data and ranks the products in comparison with your baseline GSR based on affinity. The Compass then generates a report showing the products that your body responded to more coherently, helping you make better decisions to maintain optimal health.
Even though there are many excellent nutritional supplements to choose from, one size does not fit all and your individual needs change from time to time – making it difficult to know what products, oils, and supplements would most benefit you today.
You want to invest in supplements that will do you the most good. By making the right choices you’re less likely to spend money on things you don’t need and are more likely to get the wellness benefits you’re looking for.
ZYTO biocommunication technology has been used by thousands of professionals to help their customers make better choices. With the Compass, you get this same advantage: Decision support to maintain overall wellness.
The following product lines are currently available: 4Life, Advocare, Ameo / Zija Int’l, Arbonne, Be Young, dōTERRA, Eniva Health, Forever Green, Forever Living, Herbalife, Herbax, Isagenix, Melaleuca, Nature’s Sunshine, New Sun, Nzuri, Oxynet, PBW Health, PHM Life, Purium, REDNATURA, Revii Inc., Shaklee, Solle Naturals, USANA, VEO Natural, Waiora USA, Xyngular, Youngevity, Young Living. Additional product lines can be purchased if desired.
Support Your Family’s Health Goals &/or Grow Your Own Wellness Business for Half the Price!
Have you heard the news? Due to overwhelming response, we are extending 50% off pricing for the ZYTO Compass through December!
We’re making it even easier to invest in this amazing business tool. Take advantage of this opportunity to buy the Compass for half the price and start giving your clients the individualized information they need to make the best decisions about oils and supplements.
The Compass offers a simple-to-operate prebuilt biosurvey.
ZYTO Compass is the wellness scanner empowers fellow health advocates, and inspire wellness decisions and who want to increase their product knowledge. It is also trusted by network marketers, store owners, and practitioners who want to help people make educated choices.
Every cell in your body is networked together,sending and receiving information to coordinate the millions of functions your body processes every day.
As your body adjusts to changing conditions to stay healthy, it uses these communication pathways to direct available resources to maintain balance.
Your body is so effective that most of the time you never know these adjustments are happening.
When your body encounters a larger health challenge, you may begin to show symptoms. Symptoms are the outward expression of your body’s best efforts to deal with these challenges. Common symptoms may include elevated body temperature, swelling, pain, tiredness, or a cough.
Once you recognize a symptom you can begin to assist the healing process. Things like getting more sleep, drinking more water,taking nutritional supplements, or medication under a medical professional’s supervision, can help your body deal with these challenges.
Too often we ignore our health until we get so sick that symptoms appear.
Wouldn’t you rather support your body’s day-to-day efforts to stay healthy?
During a ZYTO scan, the Hand Cradle measures your body’s galvanic skin response (GSR).
The data gathered by the Hand Cradle is evaluated by the software in the context of various digital signatures.
Digital signatures are representative of a wide range of things like foods, nutritional supplements, body organs, and systems.
Digital signatures can be organized into sequences for scanning.
You can think of ZYTO scans as questionnaires to which your body’s GSR data provides the answers.
At the completion of a scan, the software’s analysis is documented in the form of a report.
Information gathered in this way can help you make better decisions for your health.
The Compass reports only the specific products for which your body measures a biological coherence, so you don’t have to be an expert to use it and recommend products for yourself or for others. Each personalized report increases confidence and encourages purchases—you won’t even have to make a sales pitch.
Even better! The Compass contains information on all product items and can scan on specific product categories. Scan reports show the product names and descriptions, allowing both you and your client to learn more. So even if you are still getting familiar with all of the products your company of choice offers, Compass reports can help speed up the learning curve.
What does your body need to stay healthy? Many people choose to take nutritional supplements but may guess as to what supplement will work best. Even though a supplement may work for someone else, how do you know it’s providing the support you need at the present time? To make better decisions about these and other health choices you should consider ZYTO biocommunication.
Biocommunication is an exchange of information between a computer and your body; it’s like the computer is asking questions and your body is answering them.
Here’s how it works: The ZYTO software runs an energetic signature called a Virtual Item. Virtual Items are representative of physical items including nutritional supplements, body functions, and organs.
As each item is run, your body’s electrical response is measured and recorded.
The way your body responds is energetic; it’s called galvanic skin response or GSR.
ZYTO software measures complex GSR patterns and determines shifts in your energetic posture.
These shifts, either negative or positive in relation to a baseline measurement, identify what is called your biological coherence. This information is used to make better decisions about your health.
Here are just some of the many features of the Compass.
Help yourself, your family and others make better wellness decisions. Then if inspired to do so, grow a blooming business (without being salesy) with the ZYTO Compass.
CLICK HERE TO PLACE YOUR ORDER: Mary Reynolds #3520, 603-382-8848. For 27 years my husband and I have been using Natures Sunshine Products = 500+ products including singular and combination herbal supplements AND Essential Oils.
Harnessing the same powerful technology that has been used by thousands of health professionals, the ZYTO Compass provides a fast, user-friendly way to reach your healthy goals, keep your family supported and better inform your choice of nutritional supplements or oils.
The features of the ZYTO Compass allow you to maximize your sales potential, increase your credibility, and improve your relationships with clients as you show them how to discover their most biologically coherent nutritional supplements or oils. | english |
తాలిబన్లకు అమెరికా షాక్ వాషింగ్టన్: తాలిబన్లకు అమెరికా షాకిచ్చింది. 9.5 బిలియన్ డాలర్ల అఫ్ఘన్ ద్రవ్య నిల్వలను స్తంభింపజేస్తూ యూఎస్ అధ్యక్షుడు జో బైడెన్ కీలక నిర్ణయం తీసుకున్నారు. ఆఫ్ఘనిస్థాన్ బ్యాంకుకు చెందిన సుమారు 9.5 బిలియన్ డాలర్ల నిధులను తాలిబన్లు యాక్సెస్ చేయకుండా, ఆ దేశానికి బదిలీ కాకుండా నిరోధించారు. ఈ చర్య ఫలితంగా, ఆర్థిక ఆంక్షలను ఎదుర్కొంటున్న, ప్రత్యేక నియమిత జాతీయుల జాబితాలో ఉన్న తాలిబన్లు, యుఎస్లో ఉన్న ఆఫ్ఘన్ సెంట్రల్ బ్యాంక్ ఆస్తులను యాక్సెస్ చేయలేరని వాషింగ్టన్ పోస్ట్ ఓ కథనంలో పేర్కొంది. వాషింగ్టన్: తాలిబన్లకు అమెరికా షాకిచ్చింది. 9.5 బిలియన్ డాలర్ల అఫ్ఘన్ ద్రవ్య నిల్వలను స్తంభింపజేస్తూ యూఎస్ అధ్యక్షుడు జో బైడెన్ కీలక నిర్ణయం తీసుకున్నారు. ఆఫ్ఘనిస్థాన్ బ్యాంకుకు చెందిన సుమారు 9.5 బిలియన్ డాలర్ల నిధులను తాలిబన్లు యాక్సెస్ చేయకుండా, ఆ దేశానికి బదిలీ కాకుండా నిరోధించారు. ఈ చర్య ఫలితంగా, ఆర్థిక ఆంక్షలను ఎదుర్కొంటున్న, ప్రత్యేక నియమిత జాతీయుల జాబితాలో ఉన్న తాలిబన్లు, యుఎస్లో ఉన్న ఆఫ్ఘన్ సెంట్రల్ బ్యాంక్ ఆస్తులను యాక్సెస్ చేయలేరని వాషింగ్టన్ పోస్ట్ ఓ కథనంలో పేర్కొంది. | telegu |
Chicago Shooting: শিকাগোয় স্বাধীনতা দিবসের অনুষ্ঠানে চলল গুলি, নিহত ৯ জন, আহত ৫৭ আমেরিকার শিকাগোর শহরতলিতে স্বাধীনতার দিবসের অনুষ্ঠানে বন্দুকবাজের হামলা আততায়ীর গুলিতে সেখানে প্রাণ গেল নজনের পুলিশ সূত্রে খবর, গুলি চালনার ঘটনায় অন্তত ৫৭ জন আহত হয়েছেন শিকাগোর পুুলিশ সূত্রে খবর, প্রায় আট ঘণ্টা ধরে শিকাগোর বিভিন্ন জায়গায় গুলি চালিয়েছেন আততায়ী ওই বন্দুকবাজের হামলায় শিকাগোর ইলিনয়ের সাউথ ওয়েন্টওয়ার্থ অ্যাভিনিউয়ে ২৪ বছর বয়সি এক তরুণীর মৃত্যু হয়েছে গ্র্যান্ড ক্রসিংয়ের কাছেও তিন জনের মৃত্যু হয়েছে বন্দুকবাজের গুলিতে গুলিহামলায় যাঁরা আহত হয়েছেন, তাঁদের স্থানীয় হাসপাতালে ভর্তি করানো হয়েছে প্রসঙ্গত, গত বছরও আমেরিকার স্বাধীনতা দিবসের সপ্তাহে বন্দুকবাজের গুলিতে ১৯ জনের মৃত্যু হয়েছিল আহত হয়েছিলেন অন্তত ১০০ জন | bengali |
/**
* @output wp-admin/js/custom-header.js
*/
/* global isRtl */
/**
* Initializes the custom header selection page.
*
* @since 3.5.0
*
* @deprecated 4.1.0 The page this is used on is never linked to from the UI.
* Setting a custom header is completely handled by the Customizer.
*/
(function($) {
var frame;
$( function() {
// Fetch available headers.
var $headers = $('.available-headers');
// Apply jQuery.masonry once the images have loaded.
$headers.imagesLoaded( function() {
$headers.masonry({
itemSelector: '.default-header',
isRTL: !! ( 'undefined' != typeof isRtl && isRtl )
});
});
/**
* Opens the 'choose from library' frame and creates it if it doesn't exist.
*
* @since 3.5.0
* @deprecated 4.1.0
*
* @return {void}
*/
$('#choose-from-library-link').click( function( event ) {
var $el = $(this);
event.preventDefault();
// If the media frame already exists, reopen it.
if ( frame ) {
frame.open();
return;
}
// Create the media frame.
frame = wp.media.frames.customHeader = wp.media({
// Set the title of the modal.
title: $el.data('choose'),
// Tell the modal to show only images.
library: {
type: 'image'
},
// Customize the submit button.
button: {
// Set the text of the button.
text: $el.data('update'),
// Tell the button not to close the modal, since we're
// going to refresh the page when the image is selected.
close: false
}
});
/**
* Updates the window location to include the selected attachment.
*
* @since 3.5.0
* @deprecated 4.1.0
*
* @return {void}
*/
frame.on( 'select', function() {
// Grab the selected attachment.
var attachment = frame.state().get('selection').first(),
link = $el.data('updateLink');
// Tell the browser to navigate to the crop step.
window.location = link + '&file=' + attachment.id;
});
frame.open();
});
});
}(jQuery));
| code |
بولی وڈ بادشاہ شاہ رخ خان کی رواں ماہ 21 دسمبر کو ریلیز ہونے والی فلم زیرو سے تجزیہ نگاروں اور فلم کی ٹیم کو کافی امیدیں وابستہ تھیںتاہم فلم کی سست کمائی نے سب کی امیدیں توڑ دیںفلم کی ریلیز سے پہلے ہی خیال کیا جا رہا تھا کہ یہ فلم بڑی کاسٹ کی وجہ سے اچھی کمائی کرنے میں کامیاب جائے گی تاہم ایسا نہیں ہوایہ بھی پڑھیں شاہ رخ کی فلم زیرو دن میں بھی 100 کروڑ کمانے میں ناکامشاہ رخ خان کترینہ کیف اور انوشکا شرما جیسی کاسٹ پر مشتمل فلم نے اگرچہ کوئی اچھی کمائی نہیں کی تاہم خیال کیا جا رہا تھا کہ فلم پہلے ہفتے میں 100 کروڑ میں کامیاب جائے گی تاہم ایسا نہیں ہوافلم میں ٹرائی اینگل پیار کو دکھایا گیا ہےپرومو فوٹو اگرچہ فلم کو ابتدائی تین کے بعد ہی ناکام قرار دیا جانے لگا تاہم اب فلم کو ریلیز ہوئے دن گزر جانے کے باوجود اس کے 100 کروڑ کلب میں شامل نہ ہونے پر اسے ناکام کہا جا رہا ہےباکس افس انڈیا کے مطابق فلم نے ویں دن ایک کروڑ روپے سے بھی کم کمائی کی جب کہ فلم نے ساتویں دن محض کروڑ 70 لاکھ روپے بٹورےکترینہ کیف نے اداکارہ کا کردار ادا کیااسکرین شاٹ فلم نے ابتدائی دن میں بھارت بھر سے 85 کروڑ روپے سے بھی کم کمائی کی اور خیال کیا جا رہا ہے کہ فلم کو 100 کروڑ کلب میں شامل ہونے کے لیے مزید ایک ہفتہ درکار ہوگامزید پڑھیں فلم زیرو ناکام قرار پانے کے قریبرواں سال یہ پہلا موقع نہیں کہ بولی وڈ خان کی فلم ناکام ثابت ہوئی ہے شاہ رخ خان سے قبل عامر خان کی ٹھگس اف ہندوستان اور ان سے قبل سلمان خان کی ریس تھری بھی ناکام ہوچکیشاہ رخ خان بونے شخص کے روپ میں دکھائی دیےاسکرین شاٹ رواں سال تینوں خانز کی تینوں فلمز کو ناکامی کا سامنا کرنا پڑابولی وڈ خانز کے مقابلے دیگر اداکاروں کی فلمیں نہ صرف کامیاب گئیں بلکہ انہوں نے اچھی کمائی بھی کیزیرو میں پہلی بار شاہ رخ خان نے بونے شخص کا کردار ادا کیا جب کہ انوشکا شرما نے بھی پہلی بار دماغی طور مفلوج سائنسدان کا کردار ادا کیا ہےکترینہ کیف فلم میں اداکارہ اور ڈانسر کے روپ میں ںظر ائی ہیں اور تینوں کا ٹرائی اینگل پیار دکھایا گیا ہےاس سے قبل تینوں اداکار جب تک ہے جاں میں بھی ایک ساتھ کام کر چکے ہیں اور وہ فلم کامیاب گئی تھی | urdu |
Overall chemical manufacturing companies spend over £100 per employee on external application software products. The norm for the UK is half as much again. There is a stark difference in comparable spend for large organisations. Chemical manufacturers only commit a quarter of that by their all UK counterparts. | english |
രാഹുലിനും പ്രിയങ്കയ്ക്കും ലഖിംപുര് സന്ദര്ശനത്തിന് അനുമതി ലക്നോ: കോണ്ഗ്രസ് നേതാക്കളായ രാഹുല് ഗാന്ധിക്കും പ്രിയങ്ക ഗാന്ധിക്കും കര്ഷകര്ക്കെതിരായ അതിക്രമം നടന്ന ലഖിംപുര് സന്ദര്ശിക്കാന് യുപി ഭരണകൂടം അനുമതി നല്കി. പ്രിയങ്ക ഗാന്ധിയെ യുപി പൊലീസ് വിട്ടയച്ചു. കര്ഷകരുടെ കുടുംബങ്ങളെ സന്ദര്ശിക്കാന് ലഖിംപൂര് ഖേരിയിലേക്ക് പോകാന് രാഹുല് ഗാന്ധിക്കും rahul gandhi. പ്രിയങ്കാ ഗാന്ധിക്കും priyanka gandhi അനുമതി ലഭിച്ചതിന് പിന്നാലെയാണ് പ്രിയങ്കയെ യുപി പൊലീസ് വിട്ടയച്ചത്. ലഖിംപൂര് ഖേരിയിലേക്ക് പോകാനായി രാഹുല് ഗാന്ധിയുള്പ്പടെയുള്ള കോണ്ഗ്രസ് സംഘം ലക്നൗവിലെത്തി. രാഹുലിനും പ്രിയങ്കയ്ക്കുമൊപ്പം മൂന്നു പേര്ക്കും സ്ഥലത്തേക്ക് പോകാമെന്നാണ് ആഭ്യന്തര വകുപ്പ് അറിയിച്ചത്. വിഷയത്തില് കോണ്ഗ്രസിന് രാഷ്ട്രീയ മുതലെടുപ്പിന് അവസരം ലഭിക്കരുതെന്ന ബിജെപി വിലയിരുത്തലിലാണ് നേതാക്കള്ക്ക് പ്രവേശനത്തിന് അനുമതി നല്കിയത്. ഗസ്റ്റ്ഹൗസില് കസ്റ്റഡിയില് കഴിഞ്ഞിരുന്ന പ്രിയങ്കയുടെ നീക്കങ്ങളും ബിജെപിയെ ഞെട്ടിച്ചിരുന്നു. കഴിഞ്ഞ രണ്ടു ദിവസമായി ലഖിംപുര് ഖേരി വിഷയം ഉന്നയിച്ചുള്ള കോണ്ഗ്രസ് നീക്കങ്ങള്ക്ക് പ്രിയങ്ക ഗാന്ധിയാണ് നേതൃത്വം നല്കിയത്. ഇന്ന് രാഹുല് ഗാന്ധിയും ഇതേറ്റെടുത്തു. കര്ഷകരുടെ നീതിക്കായുള്ള ശബ്ദത്തെ ബി ജെ പി അടിച്ചമര്ത്തുന്നുകയാണെന്നും ആ നീക്കത്തെ ചെറുക്കുമെന്നും പുറത്തിറങ്ങിയ ശേഷം പ്രിയങ്ക ഗാന്ധി പ്രതികരിച്ചു. എസ് പി നേതാവ് അഖിലേഷ് യാദവിനും ആം ആദ്മി പാര്ട്ടി സംഘത്തിനും ലഖിംപുര് സന്ദര്ശിക്കാന് അനുമതി ലഭിച്ചിട്ടുണ്ട്. | malyali |
அபாயம்!! கடந்த 10 வருடங்களில் இல்லாத பனிப்பொழிவு. வரும் நாட்களில் அதிகரிக்கும். வானிலை ஆய்வு மையம் எச்சரிக்கை.!! பிரிட்டனில கடந்த பத்து வருடங்களாக ஏற்படாத அளவிற்கு குறைந்த அளவிலான தட்பவெப்ப நிலை நிலவுவதாக தெரிவிக்கப்பட்டுள்ளது. பிரிட்டனில கடந்த பத்து வருடங்களாக ஏற்படாத அளவிற்கு குறைந்த தட்பவெப்ப நிலை நிலவுகிறது. குறிப்பாக ஸ்காட்லாந்தில் 16.7C என்ற அளவில் வெப்பநிலை பதிவாகியிருக்கிறது. இது போன்று கடந்த 2010 ஆம் வருடத்தில் தான் இது போன்ற வெப்பநிலை பதிவாகி இருந்ததாக ஆராய்ச்சியாளர்கள் கூறுகின்றனர். மேலும் பிரிட்டனில் பனி பொழிவும் கடுமையாக ஏற்பட்டுள்ளது. இந்நிலையில் கொரோனாவால் பொது ஊரடங்கு நடைமுறைப்படுத்த பட்டிருப்பதால் மக்கள் அனைவரும் கொட்டும் பனியில் சாலைகளில் சறுக்கி விளையாடி மகிழ்ந்துவருகிறார்கள். ஸ்காட்லாந்தின் போக்குவரத்து சேவைகளில் தாமதங்கள் ஏற்படுவதும் ரத்து செய்யப்படுவது குறித்தும் போக்குவரத்து தரப்பில் எச்சரிக்கை விடுக்கப்பட்டுள்ளது. இது குறித்து வானிலை அலுவலக செய்தி தொடர்பாளரான நிக்கோலஸ் என்பவர் கூறியுள்ளதாவது, இங்கிலாந்தின் கிழக்கு பகுதிகளில் எங்கு வேண்டுமானாலும் பனிப்பொழிவு அதிகம் ஏற்பட கூடிய ஆபத்து உள்ளது. மேலும் ரஷ்யா மற்றும் கிழக்கு ஐரோப்பாவில் இருந்து குளிர் காற்று வீசுவதால் அது சிறிது ஈரப்பதத்தை எடுத்து விடும். மேலும் இந்த பனிபொழிவானது செவ்வாய் மற்றும் புதன் கிழமைகள் வரை தொடர்வதற்கான வாய்ப்பு அதிகம் உள்ளது என்று தெரிவித்துள்ளார். | tamil |
## EXAMINATION:
UNILAT UP EXT VEINS US LEFT
## INDICATION:
w/ bilateral AKAs p/w repeat L stump breakdown and UTI who
describes LEFT upper extremity swelling and pain// evaluate for LUE DVT
## FINDINGS:
There is normal flow with respiratory variation in the left subclavian vein.
The left internal jugular and axillary veins are patent, show normal color
flow and compressibility. The left brachial, basilic, and cephalic veins are
patent, compressible and show normal color flow and augmentation.
Views of the dorsal hand were obtained, as indicated by the patient as the
region of swelling. Superficial soft tissue edema is identified.
## IMPRESSION:
No evidence of deep vein thrombosis in the left upper extremity. Superficial
soft tissue edema within the left hand.
| medical |
// Script.js
// This file is slightly modified to use $script.ready() instead of jQuery.ready().
// See line 394.
var Drupal = Drupal || { 'settings': {}, 'behaviors': {}, 'locale': {} };
// Allow other JavaScript libraries to use $.
jQuery.noConflict();
(function ($) {
/**
* Attach all registered behaviors to a page element.
*
* Behaviors are event-triggered actions that attach to page elements, enhancing
* default non-JavaScript UIs. Behaviors are registered in the Drupal.behaviors
* object using the method 'attach' and optionally also 'detach' as follows:
* @code
* Drupal.behaviors.behaviorName = {
* attach: function (context, settings) {
* ...
* },
* detach: function (context, settings, trigger) {
* ...
* }
* };
* @endcode
*
* Drupal.attachBehaviors is added below to the jQuery ready event and so
* runs on initial page load. Developers implementing AHAH/Ajax in their
* solutions should also call this function after new page content has been
* loaded, feeding in an element to be processed, in order to attach all
* behaviors to the new content.
*
* Behaviors should use
* @code
* $(selector).once('behavior-name', function () {
* ...
* });
* @endcode
* to ensure the behavior is attached only once to a given element. (Doing so
* enables the reprocessing of given elements, which may be needed on occasion
* despite the ability to limit behavior attachment to a particular element.)
*
* @param context
* An element to attach behaviors to. If none is given, the document element
* is used.
* @param settings
* An object containing settings for the current context. If none given, the
* global Drupal.settings object is used.
*/
Drupal.attachBehaviors = function (context, settings) {
context = context || document;
settings = settings || Drupal.settings;
// Execute all of them.
$.each(Drupal.behaviors, function () {
if ($.isFunction(this.attach)) {
this.attach(context, settings);
}
});
};
/**
* Detach registered behaviors from a page element.
*
* Developers implementing AHAH/Ajax in their solutions should call this
* function before page content is about to be removed, feeding in an element
* to be processed, in order to allow special behaviors to detach from the
* content.
*
* Such implementations should look for the class name that was added in their
* corresponding Drupal.behaviors.behaviorName.attach implementation, i.e.
* behaviorName-processed, to ensure the behavior is detached only from
* previously processed elements.
*
* @param context
* An element to detach behaviors from. If none is given, the document element
* is used.
* @param settings
* An object containing settings for the current context. If none given, the
* global Drupal.settings object is used.
* @param trigger
* A string containing what's causing the behaviors to be detached. The
* possible triggers are:
* - unload: (default) The context element is being removed from the DOM.
* - move: The element is about to be moved within the DOM (for example,
* during a tabledrag row swap). After the move is completed,
* Drupal.attachBehaviors() is called, so that the behavior can undo
* whatever it did in response to the move. Many behaviors won't need to
* do anything simply in response to the element being moved, but because
* IFRAME elements reload their "src" when being moved within the DOM,
* behaviors bound to IFRAME elements (like WYSIWYG editors) may need to
* take some action.
* - serialize: When an Ajax form is submitted, this is called with the
* form as the context. This provides every behavior within the form an
* opportunity to ensure that the field elements have correct content
* in them before the form is serialized. The canonical use-case is so
* that WYSIWYG editors can update the hidden textarea to which they are
* bound.
*
* @see Drupal.attachBehaviors
*/
Drupal.detachBehaviors = function (context, settings, trigger) {
context = context || document;
settings = settings || Drupal.settings;
trigger = trigger || 'unload';
// Execute all of them.
$.each(Drupal.behaviors, function () {
if ($.isFunction(this.detach)) {
this.detach(context, settings, trigger);
}
});
};
/**
* Encode special characters in a plain-text string for display as HTML.
*
* @ingroup sanitization
*/
Drupal.checkPlain = function (str) {
var character, regex,
replace = { '&': '&', '"': '"', '<': '<', '>': '>' };
str = String(str);
for (character in replace) {
if (replace.hasOwnProperty(character)) {
regex = new RegExp(character, 'g');
str = str.replace(regex, replace[character]);
}
}
return str;
};
/**
* Replace placeholders with sanitized values in a string.
*
* @param str
* A string with placeholders.
* @param args
* An object of replacements pairs to make. Incidences of any key in this
* array are replaced with the corresponding value. Based on the first
* character of the key, the value is escaped and/or themed:
* - !variable: inserted as is
* - @variable: escape plain text to HTML (Drupal.checkPlain)
* - %variable: escape text and theme as a placeholder for user-submitted
* content (checkPlain + Drupal.theme('placeholder'))
*
* @see Drupal.t()
* @ingroup sanitization
*/
Drupal.formatString = function(str, args) {
// Transform arguments before inserting them.
for (var key in args) {
switch (key.charAt(0)) {
// Escaped only.
case '@':
args[key] = Drupal.checkPlain(args[key]);
break;
// Pass-through.
case '!':
break;
// Escaped and placeholder.
case '%':
default:
args[key] = Drupal.theme('placeholder', args[key]);
break;
}
str = str.replace(key, args[key]);
}
return str;
};
/**
* Translate strings to the page language or a given language.
*
* See the documentation of the server-side t() function for further details.
*
* @param str
* A string containing the English string to translate.
* @param args
* An object of replacements pairs to make after translation. Incidences
* of any key in this array are replaced with the corresponding value.
* See Drupal.formatString().
*
* @param options
* - 'context' (defaults to the empty context): The context the source string
* belongs to.
*
* @return
* The translated string.
*/
Drupal.t = function (str, args, options) {
options = options || {};
options.context = options.context || '';
// Fetch the localized version of the string.
if (Drupal.locale.strings && Drupal.locale.strings[options.context] && Drupal.locale.strings[options.context][str]) {
str = Drupal.locale.strings[options.context][str];
}
if (args) {
str = Drupal.formatString(str, args);
}
return str;
};
/**
* Format a string containing a count of items.
*
* This function ensures that the string is pluralized correctly. Since Drupal.t() is
* called by this function, make sure not to pass already-localized strings to it.
*
* See the documentation of the server-side format_plural() function for further details.
*
* @param count
* The item count to display.
* @param singular
* The string for the singular case. Please make sure it is clear this is
* singular, to ease translation (e.g. use "1 new comment" instead of "1 new").
* Do not use @count in the singular string.
* @param plural
* The string for the plural case. Please make sure it is clear this is plural,
* to ease translation. Use @count in place of the item count, as in "@count
* new comments".
* @param args
* An object of replacements pairs to make after translation. Incidences
* of any key in this array are replaced with the corresponding value.
* See Drupal.formatString().
* Note that you do not need to include @count in this array.
* This replacement is done automatically for the plural case.
* @param options
* The options to pass to the Drupal.t() function.
* @return
* A translated string.
*/
Drupal.formatPlural = function (count, singular, plural, args, options) {
var args = args || {};
args['@count'] = count;
// Determine the index of the plural form.
var index = Drupal.locale.pluralFormula ? Drupal.locale.pluralFormula(args['@count']) : ((args['@count'] == 1) ? 0 : 1);
if (index == 0) {
return Drupal.t(singular, args, options);
}
else if (index == 1) {
return Drupal.t(plural, args, options);
}
else {
args['@count[' + index + ']'] = args['@count'];
delete args['@count'];
return Drupal.t(plural.replace('@count', '@count[' + index + ']'), args, options);
}
};
/**
* Generate the themed representation of a Drupal object.
*
* All requests for themed output must go through this function. It examines
* the request and routes it to the appropriate theme function. If the current
* theme does not provide an override function, the generic theme function is
* called.
*
* For example, to retrieve the HTML for text that should be emphasized and
* displayed as a placeholder inside a sentence, call
* Drupal.theme('placeholder', text).
*
* @param func
* The name of the theme function to call.
* @param ...
* Additional arguments to pass along to the theme function.
* @return
* Any data the theme function returns. This could be a plain HTML string,
* but also a complex object.
*/
Drupal.theme = function (func) {
var args = Array.prototype.slice.apply(arguments, [1]);
return (Drupal.theme[func] || Drupal.theme.prototype[func]).apply(this, args);
};
/**
* Freeze the current body height (as minimum height). Used to prevent
* unnecessary upwards scrolling when doing DOM manipulations.
*/
Drupal.freezeHeight = function () {
Drupal.unfreezeHeight();
$('<div id="freeze-height"></div>').css({
position: 'absolute',
top: '0px',
left: '0px',
width: '1px',
height: $('body').css('height')
}).appendTo('body');
};
/**
* Unfreeze the body height.
*/
Drupal.unfreezeHeight = function () {
$('#freeze-height').remove();
};
/**
* Encodes a Drupal path for use in a URL.
*
* For aesthetic reasons slashes are not escaped.
*/
Drupal.encodePath = function (item, uri) {
uri = uri || location.href;
return encodeURIComponent(item).replace(/%2F/g, '/');
};
/**
* Get the text selection in a textarea.
*/
Drupal.getSelection = function (element) {
if (typeof element.selectionStart != 'number' && document.selection) {
// The current selection.
var range1 = document.selection.createRange();
var range2 = range1.duplicate();
// Select all text.
range2.moveToElementText(element);
// Now move 'dummy' end point to end point of original range.
range2.setEndPoint('EndToEnd', range1);
// Now we can calculate start and end points.
var start = range2.text.length - range1.text.length;
var end = start + range1.text.length;
return { 'start': start, 'end': end };
}
return { 'start': element.selectionStart, 'end': element.selectionEnd };
};
/**
* Build an error message from an Ajax response.
*/
Drupal.ajaxError = function (xmlhttp, uri) {
var statusCode, statusText, pathText, responseText, readyStateText, message;
if (xmlhttp.status) {
statusCode = "\n" + Drupal.t("An AJAX HTTP error occurred.") + "\n" + Drupal.t("HTTP Result Code: !status", {'!status': xmlhttp.status});
}
else {
statusCode = "\n" + Drupal.t("An AJAX HTTP request terminated abnormally.");
}
statusCode += "\n" + Drupal.t("Debugging information follows.");
pathText = "\n" + Drupal.t("Path: !uri", {'!uri': uri} );
statusText = '';
// In some cases, when statusCode == 0, xmlhttp.statusText may not be defined.
// Unfortunately, testing for it with typeof, etc, doesn't seem to catch that
// and the test causes an exception. So we need to catch the exception here.
try {
statusText = "\n" + Drupal.t("StatusText: !statusText", {'!statusText': $.trim(xmlhttp.statusText)});
}
catch (e) {}
responseText = '';
// Again, we don't have a way to know for sure whether accessing
// xmlhttp.responseText is going to throw an exception. So we'll catch it.
try {
responseText = "\n" + Drupal.t("ResponseText: !responseText", {'!responseText': $.trim(xmlhttp.responseText) } );
} catch (e) {}
// Make the responseText more readable by stripping HTML tags and newlines.
responseText = responseText.replace(/<("[^"]*"|'[^']*'|[^'">])*>/gi,"");
responseText = responseText.replace(/[\n]+\s+/g,"\n");
// We don't need readyState except for status == 0.
readyStateText = xmlhttp.status == 0 ? ("\n" + Drupal.t("ReadyState: !readyState", {'!readyState': xmlhttp.readyState})) : "";
message = statusCode + pathText + statusText + responseText + readyStateText;
return message;
};
// Class indicating that JS is enabled; used for styling purpose.
$('html').addClass('js');
// 'js enabled' cookie.
document.cookie = 'has_js=1; path=/';
/**
* Additions to jQuery.support.
*/
$(function () {
/**
* Boolean indicating whether or not position:fixed is supported.
*/
if (jQuery.support.positionFixed === undefined) {
var el = $('<div style="position:fixed; top:10px" />').appendTo(document.body);
jQuery.support.positionFixed = el[0].offsetTop === 10;
el.remove();
}
});
//Attach all behaviors.
// This is the only thing we change in Drupal.js.
$script.ready(scriptjs_module_last, function() {
Drupal.attachBehaviors(document, Drupal.settings);
});
/**
* The default themes.
*/
Drupal.theme.prototype = {
/**
* Formats text for emphasized display in a placeholder inside a sentence.
*
* @param str
* The text to format (plain-text).
* @return
* The formatted text (html).
*/
placeholder: function (str) {
return '<em class="placeholder">' + Drupal.checkPlain(str) + '</em>';
}
};
})(jQuery);
| code |
ಬಿ.ಎಸ್ಸಿಸಿಬಿಝೆಡ್ ನಂತರ ಯಾವ ಕೋರ್ಸ್ ಸೂಕ್ತ ? 1. ನಾನು ಬಿಎಸ್ಸಿ ಸಿಬಿಝೆಡ್ ಪೂರ್ಣಗೊಳಿಸಿದ್ದೇನೆ. ಆಹಾರ ವಿಜ್ಞಾನ ಅಥವಾ ನ್ಯೂಟ್ರಿಷನ್ ಸಂಬಂಧಪಟ್ಟಂತೆ ಎಂಎಸ್ಸಿ ಮಾಡಬೇಕೆಂದಿದ್ದೇನೆ. ಆದರೆ, ನನ್ನ ಗೆಳೆಯರು ಎಂಎಸ್ಸಿ ಆಹಾರ ವಿಜ್ಞಾನ ಬದಲಾಗಿ ಎಂಎಸ್ಸಿ ಪ್ರಾಣಿವಿಜ್ಞಾನ ಮಾಡುವಂತೆ ಹೇಳುತ್ತಿದ್ದಾರೆ. ಯಾವುದನ್ನು ಆಯ್ಕೆ ಮಾಡಿಕೊಳ್ಳುವುದು ಉತ್ತಮ? ಸಿಂಧೂ, ತುಮಕೂರು. ಜೀವನ ಶೈಲಿ ಮತ್ತು ಅಗತ್ಯಗಳು ಬದಲಾಗಿರುವ ಈ ಕಾಲಘಟ್ಟದಲ್ಲಿ ಸಿದ್ಧಪಡಿಸಿದ ಆಹಾರ ಪದಾರ್ಥಗಳಿಗೆ ಹೆಚ್ಚಿನ ಬೇಡಿಕೆಯಿದ್ದು , ಆಹಾರ ವಿಜ್ಞಾನ ಮತ್ತು ಪುಷ್ಟಿ ವಿಜ್ಞಾನ ನ್ಯೂಟ್ರಿಷನ್ ಮುಂಚೂಣಿಯಲ್ಲಿದೆ. ಕಚ್ಛಾ ಧಾನ್ಯಗಳು ಮತ್ತು ಇನ್ನಿತರ ಆಹಾರ ಪದಾರ್ಥಗಳ ಶುದ್ಧೀಕರಣ, ಸಂಸ್ಕರಣೆ, ಸುರಕ್ಷತೆ ಮತ್ತು ಸೂಕ್ತ ಪ್ಯಾಕಿಂಗ್ ನಂತರ ಬಳಕೆಗೆ ಯೋಗ್ಯ ರೀತಿಯಲ್ಲಿ ಸಿದ್ಧಪಡಿಸುವ ಕಾರ್ಯಗಳಲ್ಲಿ ಆಹಾರ ವಿಜ್ಞಾನ, ಪ್ರಮುಖ ಪಾತ್ರವಹಿಸುತ್ತದೆ. ಹಾಗಾಗಿ, ಈ ಕ್ಷೇತ್ರದಲ್ಲಿ ಆಸಕ್ತಿಯಿದ್ದಲ್ಲಿ, ಎಂಎಸ್ಸಿ ಕೋರ್ಸ್ ಮಾಡಬಹುದು. ಈ ಕೋರ್ಸ್ ನಂತರ, ಸರ್ಕಾರಿ ಮತ್ತು ಖಾಸಗಿ ಕ್ಷೇತ್ರದ ಆಹಾರ ಪದಾರ್ಥ ಮತ್ತು ಪಾನೀಯ ತಯಾರಿಕಾ ಉದ್ದಿಮೆಗಳು, ಆಹಾರ ಸಂಬಂಧಿತ ಸಂರಕ್ಷಕಗಳು, ಬಣ್ಣಗಳು ಮತ್ತು ಸ್ವಾದಗಳು ಇತ್ಯಾದಿ ಉದ್ದಿಮೆಗಳು, ಕೃಷಿ ಉದ್ದಿಮೆಗಳು, ಸಾವಯವ ಉದ್ದಿಮೆಗಳು, ಹೋಟೆಲ್ ಮತ್ತು ರೆಸ್ಟೋರೆಂಟ್ಸ್, ಆಸ್ಪತ್ರೆಗಳು, ಶಿಕ್ಷಣ ಸಂಸ್ಥೆಗಳು, ಸಂಶೋಧನಾ ಸಂಸ್ಥೆಗಳು, ಆಹಾರ ಪರೀಕ್ಷಾ ಪ್ರಯೋಗಾಲಯಗಳು ಸೇರಿ ವಿಪುಲವಾದ ಉದ್ಯೋಗಾವಕಾಶಗಳಿವೆ. 2. ನಾನು ದೂರಶಿಕ್ಷಣದಲ್ಲಿ ಬಿಎ ಪದವಿ ಪಡೆದಿದ್ದೇನೆ. ಮುಂದೆ, ಎಲ್ಎಲ್ಬಿ ಮಾಡುವ ಆಸೆ ಇದೆ. ಇದಕ್ಕೆ ಬೇರೆ ಯಾವುದಾದರೂ ಕೋರ್ಸ್ ಮಾಡಬೇಕೆ ಅಥವಾ ನೇರವಾಗಿ ಎಲ್ಎಲ್ಬಿ ಮಾಡಬಹುದೇ ತಿಳಿಸಿ? ದೀಪಿಕಾ, ದಾವಣಗೆರೆ. ದೂರ ಶಿಕ್ಷಣ ಬ್ಯೂರೊ, ವಿಶ್ವವಿದ್ಯಾಲಯ ಅನುದಾನ ಆಯೋಗ ಯುಜಿಸಿ, ಮಾನ್ಯತೆ ಪಡೆದ ಯಾವುದೇ ವಿಶ್ವವಿದ್ಯಾಲಯದ ಪದವೀಧರರಿಗೆ, ಎಲ್ಎಲ್ಬಿ ಕೋರ್ಸ್ ಮಾಡಲು ಅರ್ಹತೆ ಇರುತ್ತದೆ. 3. ನಾನು ಪದವಿ ಮುಗಿಸಿದ್ದು, ಆಧಾರ್ ಎನ್ರೋಲ್ಮೆಂಟ್ ಪರೀಕ್ಷೆ ಪಾಸ್ ಆಗಿದ್ದೇನೆ ಮತ್ತು ಏಜೆನ್ಸಿಯ ಅವಧಿ 1 ವರ್ಷವಿದೆ. ನಂತರದಲ್ಲಿ ನಾವು ಕೆಲಸ ಇಲ್ಲದೆ ಇರಬೇಕಾಗುತ್ತದೆ. ಆದ್ದರಿಂದ, ನಾನು ಯುಐಡಿಎಐ UIDAI ಸಂಸ್ಥೆಯಲ್ಲಿ ಮುಂದುವರಿಯುವುದು ಹೇಗೆ? ಇದಕ್ಕೆ ಸರ್ಕಾರಿ ನೇಮಕಾತಿ ಇದೆಯೇ? ದುರ್ಗೇಶ್ ಪಾಟೀಲ, ಊರು ತಿಳಿಸಿಲ್ಲ. ಯುಐಡಿಎಐ UIDAI, ಭಾರತ ಸರ್ಕಾರದ ವಿದ್ಯುನ್ಮಾನಗಳು ಮತ್ತು ಮಾಹಿತಿ ತಂತ್ರಜ್ಞಾನ ಸಚಿವಾಲಯದ ಅಡಿಯಲ್ಲಿ ಸ್ಥಾಪಿಸಲಾದ ಒಂದು ಶಾಸನಬದ್ಧ ಪ್ರಾಧಿಕಾರವಾಗಿರುತ್ತದೆ. ಈ ಸಂಸ್ಥೆಯಲ್ಲಿನ ಹಲವಾರು ಹುದ್ದೆಗಳಿಗೆ ನೇರವಾಗಿ ನೇಮಕಾತಿಯಾಗುತ್ತದೆ. ಹೆಚ್ಚಿನ ಮಾಹಿತಿಗಾಗಿ ಗಮನಿಸಿ: https:uidai.gov.inaboutuidaiworkwithuidai.html 4. ನಾನು ಪಿಯುಸಿ ಕಲಾ ವಿಭಾಗದಲ್ಲಿ ಶೇ 93 ಅಂಕದೊಂದಿಗೆ ಪಾಸಾಗಿದ್ದೇನೆ. ಕಲಾ ವಿಭಾಗ ಯಾವುದಕ್ಕೂ ಪ್ರಯೋಜನವಿಲ್ಲ ಎಂದು ಬಹಳ ಜನ ಹೇಳುತ್ತಾರೆ. ಏನು ಮಾಡಬೇಕು ಎಂಬುದೇ ತೋಚದಾಗಿದೆ. ಸಲಹೆ ಕೊಡಿ ಹೆಸರು, ಊರು ತಿಳಿಸಿಲ್ಲ. ಕಲಾ ವಿಭಾಗದಲ್ಲಿ ಅವಕಾಶಗಳು ಕಡಿಮೆ ಎನ್ನುವ ತಪ್ಪು ಅಭಿಪ್ರಾಯ ಹಲವರಲ್ಲಿದೆ. ಪಿಯುಸಿ ನಂತರ ಅನೇಕ ವಿಷಯಗಳಲ್ಲಿ ಬಿಎ ಪದವಿಯನ್ನು ಮಾಡಬಹುದು. ಉದಾಹರಣೆಗೆ, ಕನ್ನಡ, ಇಂಗ್ಲಿಷ್, ಅರ್ಥಶಾಸ್ತ್ರ ಸಮಾಜಶಾಸ್ತ್ರ, ಚರಿತ್ರೆ, ರಾಜ್ಯಶಾಸ್ತ್ರ, ತತ್ವಶಾಸ್ತ್ರ, ಮನೋವಿಜ್ಞಾನ, ಮಾನವಶಾಸ್ತ್ರ, ಪುರಾತತ್ವ ಶಾಸ್ತ್ರ ಪರಿಸರ ವಿಜ್ಞಾನ, ಪತ್ರಿಕೋದ್ಯಮ, ಲಲಿತಕಲೆ, ಹೋಟೆಲ್ ಮ್ಯಾನೇಜ್ಮೆಂಟ್, ಟೂರಿಸಮ್ ಇತ್ಯಾದಿ. ಜೊತೆಗೆ, ಯಾವುದಾದರೂ ವಿಷಯದಲ್ಲಿ ವಿಶೇಷವಾದ ಆಸಕ್ತಿಯಿದ್ದಲ್ಲಿ, ಬಿಎ ಆನರ್ಸ್ ಮಾಡಬಹುದು. ಕಲಾ ವಿಭಾಗದಲ್ಲಿ ಮಾಡಬಹುದಾದ ಇನ್ನಿತರ ಪ್ರಮುಖ ಕೋರ್ಸ್ಗಳೆಂದರೆ ಬಿಬಿಎ, ಬಿಕಾಂಬಿಸಿಎ ಕೆಲವು ವಿಶ್ವವಿದ್ಯಾಲಯಗಳಲ್ಲಿ, ಬಿಎಸ್ಡಬ್ಲು, ಬಿ.ಡಿಸೈನ್, ಎಲ್ಎಲ್ಬಿ ಇಂಟಿಗ್ರೇಟೆಡ್, ಸಿಎ, ಸಿಎಸ್, ಐಎಎಸ್ ಪದವಿಯ ನಂತರ ಇತ್ಯಾದಿ. ಹಾಗಾಗಿ, ಕಲಾ ವಿಭಾಗ ವಿಸ್ತಾರವಾದ ಕ್ಷೇತ್ರ. ನಿಮ್ಮ ಆಸಕ್ತಿ, ಅಭಿರುಚಿಯಂತೆ ಕೋರ್ಸ್ ಆಯ್ಕೆ ಮಾಡಿ, ನಿಮ್ಮ ಭವಿಷ್ಯವನ್ನು ರೂಪಿಸಿಕೊಳ್ಳಿ. ನಿಮ್ಮ ಪ್ರಶ್ನೆಗೆ ತಜ್ಞರ ಉತ್ತರ ವಿದ್ಯಾರ್ಥಿಗಳೇ, ನಿಮ್ಮ ಮುಂದಿನ ಕೋರ್ಸ್ ಮತ್ತು ಸೂಕ್ತವಾದ ವೃತ್ತಿಯ ಆಯ್ಕೆ ಹಾಗೂ ಭವಿಷ್ಯವನ್ನು ರೂಪಿಸಿಕೊಳ್ಳುವ ಬಗ್ಗೆ ಗೊಂದಲಗಳಿವೆಯೇ? ಹಾಗಿದ್ದರೆ ನಮಗೆ ಬರೆಯಿರಿ. ನಿಮ್ಮ ಪ್ರಶ್ನೆಗಳಿಗೆ ಶಿಕ್ಷಣ ತಜ್ಞ ಮತ್ತು ವೃತ್ತಿ ಸಲಹೆಗಾರ ವಿ. ಪ್ರದೀಪ್ ಕುಮಾರ್ ಉತ್ತರಿಸಲಿದ್ದಾರೆ. ಪ್ರಶ್ನೆಗಳನ್ನು shikshanaprajavani.co.in ಗೆ ಕಳಿಸಬಹುದು. | kannad |
பிரபல தொகுப்பாளர் மாகாபாவிற்கு கைவிரலில் எலும்பு முறிவு. வெளியான எக்ஸ்ரே புகைப்படம்.!!! பிரபல தொகுப்பாளர் மாகாபாவிற்கு திடீரென கை விரலில் எலும்பு முறிவு ஏற்பட்டுள்ளது. விஜய் டிவியின் மூலம் மிகவும் பிரபலமான தொகுப்பாளராக வலம் வருபவர் மாகாபா. இவர் தொகுத்து வழங்கும் அழகிற்கென்றே மிகப்பெரிய ரசிகர் பட்டாளம் உள்ளனர். ஏனென்றால் அந்த அளவிற்கு இவர் கலகலப்பாக நடந்து கொள்வார். இந்நிலையில் அவரது ரசிகர்களுக்கு அதிர்ச்சி அளிக்கும் வகையில் ஒரு செய்தி வெளியாகியுள்ளது. அது என்னவென்றால் தொகுப்பாளர் மாகாபாவிற்கு கை விரலில் எலும்பு முறிவு ஏற்பட்டுள்ளது. இந்த தகவலை மாகாபா ஆனந்த் தனது சமூக வலைத்தளத்தில் பகிர்ந்து அதனுடன் எக்ஸ்ரே புகைப்படத்தையும் பதிவு செய்துள்ளார். இதனைக்கண்ட அவரது ரசிகர்களும், பிரபலங்களும் விரைவில் குணமடைய வேண்டும் என்று கமெண்ட் செய்து வருகின்றனர். | tamil |
શેરબજારમાં સતત બીજા દિવસે કડાકો સેન્સેક્સ ૩૮૮, નિફ્ટી ૧૪૫ પોઈન્ટ તૂટ્યો સ્થાનિક શેરબજારોમાં મંગળવારે સતત બીજા દિવસે ઘટાડો ચાલુ રહ્યો હતો અને બીએસઈ સેન્સેક્સ ૩૮૮ પોઈન્ટથી વધુ ઘટીને ૫૮,૫૭૬.૩૭ પર બંધ રહ્યો હતો. વૈશ્વિક બજારોમાં નબળા વલણ વચ્ચે ઇન્ડેક્સ હેવીવેઇટ વિપ્રો, રિલાયન્સ ઇન્ડસ્ટ્રીઝ અને ભારતી એરટેલમાં નુકસાન સાથે બજારો નુકસાનમાં બંધ થયા હતા. માર્ચના ઔદ્યોગિક ઉત્પાદન આઈઆઈપી અને ફુગાવાના ડેટા પહેલા પણ રોકાણકારોએ સાવચેતીભર્યું વલણ અપનાવ્યું હતું. ૩૦ શેરવાળો સેન્સેક્સ ૩૮૮.૨૦ પોઈન્ટ અથવા ૦.૬૬ ટકાના ઘટાડા સાથે ૫૮,૫૭૬.૩૭ પર બંધ થયો હતો. ટ્રેડિંગ દરમિયાન સેન્સેક્સ એક તબક્કે ૬૬૬ પોઈન્ટ નીચે ગયો હતો. નેશનલ સ્ટોક એક્સચેન્જનો નિફ્ટી પણ ૧૪૪.૬૫ પોઈન્ટ એટલે કે ૦.૮૨ ટકાના ઘટાડા સાથે ૧૭,૫૩૦.૩૦ પર બંધ થયો હતો. સેન્સેક્સના ત્રીસ શેરોમાંથી, ટાટા સ્ટીલ, વિપ્રો, ટેક મહિન્દ્રા, ભારતી એરટેલ, રિલાયન્સ ઇન્ડસ્ટ્રીઝ, લાર્સન એન્ડ ટુબ્રો અને બજાજ ફિનસર્વ મુખ્ય ઘટ્યા હતા. તેનાથી વિપરીત, એક્સિસ બેંક, કોટક મહિન્દ્રા બેંક, પાવરગ્રીડ, મારુતિ સુઝુકી અને આઈસીઆઈસીઆ બેંકના શેરના ભાવ ઊંચકાયા હતા. અન્ય એશિયન બજારોમાં, જાપાનનો નિક્કી અને દક્ષિણ કોરિયાનો કોસ્પી ખોટમાં હતા, જ્યારે ચીનનો શાંઘાઈ કમ્પોઝિટ અને હોંગકોંગનો હેંગસેંગ લાભમાં બંધ રહ્યા હતા. ઈન્ટરનેશનલ ઓઈલ બેન્ચમાર્ક બ્રેન્ટ ક્રૂડ ૩.૨૦ ટકા વધીને ૧૦૧.૬ ડોલર પ્રતિ બેરલ થઈ ગયું છે. શેરબજારના આંકડા અનુસાર સોમવારે વિદેશી સંસ્થાકીય રોકાણકારોએ રૂ. ૧,૧૪૫.૨૪ કરોડના શેરનું વેચાણ કર્યું હતું. જિયોજીત ફાઇનાન્શિયલ સર્વિસિસના ચીફ ઇન્વેસ્ટમેન્ટ સ્ટ્રેટેજિસ્ટ વીકે વિજયકુમારે જણાવ્યું હતું કે, બજાર નજીકના ભવિષ્યમાં અસ્થિર રહેશે. તે સકારાત્મક અને નકારાત્મક સમાચારો અનુસાર વધઘટ કરતું રહેશે. ટૂંકા ગાળામાં, યુએસ બોન્ડ યીલ્ડમાં તેજીનો પડકાર છે. ૧૦ વર્ષની મુદતવાળા બોન્ડના કિસ્સામાં તે ૨.૮ ટકાને વટાવી ગયો છે. આ ઉપરાંત, શેરબજારમાંથી બહાર નીકળવાનું ચાલુ છે. તેમણે કહ્યું, નાસ્ડેક પર ટેક્નોલોજી ઈન્ડેક્સ નીચે આવ્યો છે અને તેના કારણે ભારતીય આઈટી શેરોમાં પણ વેચવાલી થઈ છે. પરંતુ ટીસીએસના પરિણામોને જાેતા આઈટી કંપનીઓ આઉટપરફોર્મ કરશે તેવી અપેક્ષા છે. ટીસીએસના પરિણામો સાથે, અન્ય આઈટી કંપનીઓના ઓર્ડર મજબૂત રહેવાની ધારણા છે. ટીસીએસનો શેર ૦.૧૩ ટકાના ઘટાડા સાથે રૂ. ૩,૬૯૧.૪૫ પર બંધ થયો હતો. દેશની સૌથી મોટી સોફ્ટવેર સર્વિસીસ કંપની ટાટા કન્સલ્ટન્સી સર્વિસિસ એ નાણાકીય વર્ષ ૨૦૨૧૨૨ના ચોથા ક્વાર્ટરમાં ચોખ્ખો નફો ૭.૪ ટકા વધીને રૂ. ૯,૯૨૬ કરોડ નોંધ્યો છે. કંપનીની આવક કોઈપણ ક્વાર્ટરમાં પ્રથમ વખત રૂ. ૫૦,૦૦૦ કરોડને વટાવી ગઈ છે. | gujurati |
/*
* Copyright 2007-2010 Analog Devices Inc.
*
* Licensed under the GPL-2 or later.
*/
#ifndef _CDEF_BF54X_H
#define _CDEF_BF54X_H
/* ************************************************************** */
/* SYSTEM & MMR ADDRESS DEFINITIONS COMMON TO ALL ADSP-BF54x */
/* ************************************************************** */
/* PLL Registers */
#define bfin_read_PLL_CTL() bfin_read16(PLL_CTL)
#define bfin_read_PLL_DIV() bfin_read16(PLL_DIV)
#define bfin_write_PLL_DIV(val) bfin_write16(PLL_DIV, val)
#define bfin_read_VR_CTL() bfin_read16(VR_CTL)
#define bfin_read_PLL_STAT() bfin_read16(PLL_STAT)
#define bfin_write_PLL_STAT(val) bfin_write16(PLL_STAT, val)
#define bfin_read_PLL_LOCKCNT() bfin_read16(PLL_LOCKCNT)
#define bfin_write_PLL_LOCKCNT(val) bfin_write16(PLL_LOCKCNT, val)
/* Debug/MP/Emulation Registers (0xFFC00014 - 0xFFC00014) */
#define bfin_read_CHIPID() bfin_read32(CHIPID)
#define bfin_write_CHIPID(val) bfin_write32(CHIPID, val)
/* System Reset and Interrubfin_read_()t Controller (0xFFC00100 - 0xFFC00104) */
#define bfin_read_SWRST() bfin_read16(SWRST)
#define bfin_write_SWRST(val) bfin_write16(SWRST, val)
#define bfin_read_SYSCR() bfin_read16(SYSCR)
#define bfin_write_SYSCR(val) bfin_write16(SYSCR, val)
/* SIC Registers */
#define bfin_read_SIC_RVECT() bfin_read32(SIC_RVECT)
#define bfin_write_SIC_RVECT(val) bfin_write32(SIC_RVECT, val)
#define bfin_read_SIC_IMASK0() bfin_read32(SIC_IMASK0)
#define bfin_write_SIC_IMASK0(val) bfin_write32(SIC_IMASK0, val)
#define bfin_read_SIC_IMASK1() bfin_read32(SIC_IMASK1)
#define bfin_write_SIC_IMASK1(val) bfin_write32(SIC_IMASK1, val)
#define bfin_read_SIC_IMASK2() bfin_read32(SIC_IMASK2)
#define bfin_write_SIC_IMASK2(val) bfin_write32(SIC_IMASK2, val)
#define bfin_read_SIC_IMASK(x) bfin_read32(SIC_IMASK0 + (x << 2))
#define bfin_write_SIC_IMASK(x, val) bfin_write32((SIC_IMASK0 + (x << 2)), val)
#define bfin_read_SIC_ISR0() bfin_read32(SIC_ISR0)
#define bfin_write_SIC_ISR0(val) bfin_write32(SIC_ISR0, val)
#define bfin_read_SIC_ISR1() bfin_read32(SIC_ISR1)
#define bfin_write_SIC_ISR1(val) bfin_write32(SIC_ISR1, val)
#define bfin_read_SIC_ISR2() bfin_read32(SIC_ISR2)
#define bfin_write_SIC_ISR2(val) bfin_write32(SIC_ISR2, val)
#define bfin_read_SIC_ISR(x) bfin_read32(SIC_ISR0 + (x << 2))
#define bfin_write_SIC_ISR(x, val) bfin_write32((SIC_ISR0 + (x << 2)), val)
#define bfin_read_SIC_IWR0() bfin_read32(SIC_IWR0)
#define bfin_write_SIC_IWR0(val) bfin_write32(SIC_IWR0, val)
#define bfin_read_SIC_IWR1() bfin_read32(SIC_IWR1)
#define bfin_write_SIC_IWR1(val) bfin_write32(SIC_IWR1, val)
#define bfin_read_SIC_IWR2() bfin_read32(SIC_IWR2)
#define bfin_write_SIC_IWR2(val) bfin_write32(SIC_IWR2, val)
#define bfin_read_SIC_IAR0() bfin_read32(SIC_IAR0)
#define bfin_write_SIC_IAR0(val) bfin_write32(SIC_IAR0, val)
#define bfin_read_SIC_IAR1() bfin_read32(SIC_IAR1)
#define bfin_write_SIC_IAR1(val) bfin_write32(SIC_IAR1, val)
#define bfin_read_SIC_IAR2() bfin_read32(SIC_IAR2)
#define bfin_write_SIC_IAR2(val) bfin_write32(SIC_IAR2, val)
#define bfin_read_SIC_IAR3() bfin_read32(SIC_IAR3)
#define bfin_write_SIC_IAR3(val) bfin_write32(SIC_IAR3, val)
#define bfin_read_SIC_IAR4() bfin_read32(SIC_IAR4)
#define bfin_write_SIC_IAR4(val) bfin_write32(SIC_IAR4, val)
#define bfin_read_SIC_IAR5() bfin_read32(SIC_IAR5)
#define bfin_write_SIC_IAR5(val) bfin_write32(SIC_IAR5, val)
#define bfin_read_SIC_IAR6() bfin_read32(SIC_IAR6)
#define bfin_write_SIC_IAR6(val) bfin_write32(SIC_IAR6, val)
#define bfin_read_SIC_IAR7() bfin_read32(SIC_IAR7)
#define bfin_write_SIC_IAR7(val) bfin_write32(SIC_IAR7, val)
#define bfin_read_SIC_IAR8() bfin_read32(SIC_IAR8)
#define bfin_write_SIC_IAR8(val) bfin_write32(SIC_IAR8, val)
#define bfin_read_SIC_IAR9() bfin_read32(SIC_IAR9)
#define bfin_write_SIC_IAR9(val) bfin_write32(SIC_IAR9, val)
#define bfin_read_SIC_IAR10() bfin_read32(SIC_IAR10)
#define bfin_write_SIC_IAR10(val) bfin_write32(SIC_IAR10, val)
#define bfin_read_SIC_IAR11() bfin_read32(SIC_IAR11)
#define bfin_write_SIC_IAR11(val) bfin_write32(SIC_IAR11, val)
/* Watchdog Timer Registers */
#define bfin_read_WDOG_CTL() bfin_read16(WDOG_CTL)
#define bfin_write_WDOG_CTL(val) bfin_write16(WDOG_CTL, val)
#define bfin_read_WDOG_CNT() bfin_read32(WDOG_CNT)
#define bfin_write_WDOG_CNT(val) bfin_write32(WDOG_CNT, val)
#define bfin_read_WDOG_STAT() bfin_read32(WDOG_STAT)
#define bfin_write_WDOG_STAT(val) bfin_write32(WDOG_STAT, val)
/* RTC Registers */
#define bfin_read_RTC_STAT() bfin_read32(RTC_STAT)
#define bfin_write_RTC_STAT(val) bfin_write32(RTC_STAT, val)
#define bfin_read_RTC_ICTL() bfin_read16(RTC_ICTL)
#define bfin_write_RTC_ICTL(val) bfin_write16(RTC_ICTL, val)
#define bfin_read_RTC_ISTAT() bfin_read16(RTC_ISTAT)
#define bfin_write_RTC_ISTAT(val) bfin_write16(RTC_ISTAT, val)
#define bfin_read_RTC_SWCNT() bfin_read16(RTC_SWCNT)
#define bfin_write_RTC_SWCNT(val) bfin_write16(RTC_SWCNT, val)
#define bfin_read_RTC_ALARM() bfin_read32(RTC_ALARM)
#define bfin_write_RTC_ALARM(val) bfin_write32(RTC_ALARM, val)
#define bfin_read_RTC_PREN() bfin_read16(RTC_PREN)
#define bfin_write_RTC_PREN(val) bfin_write16(RTC_PREN, val)
/* UART0 Registers */
#define bfin_read_UART0_DLL() bfin_read16(UART0_DLL)
#define bfin_write_UART0_DLL(val) bfin_write16(UART0_DLL, val)
#define bfin_read_UART0_DLH() bfin_read16(UART0_DLH)
#define bfin_write_UART0_DLH(val) bfin_write16(UART0_DLH, val)
#define bfin_read_UART0_GCTL() bfin_read16(UART0_GCTL)
#define bfin_write_UART0_GCTL(val) bfin_write16(UART0_GCTL, val)
#define bfin_read_UART0_LCR() bfin_read16(UART0_LCR)
#define bfin_write_UART0_LCR(val) bfin_write16(UART0_LCR, val)
#define bfin_read_UART0_MCR() bfin_read16(UART0_MCR)
#define bfin_write_UART0_MCR(val) bfin_write16(UART0_MCR, val)
#define bfin_read_UART0_LSR() bfin_read16(UART0_LSR)
#define bfin_write_UART0_LSR(val) bfin_write16(UART0_LSR, val)
#define bfin_read_UART0_MSR() bfin_read16(UART0_MSR)
#define bfin_write_UART0_MSR(val) bfin_write16(UART0_MSR, val)
#define bfin_read_UART0_SCR() bfin_read16(UART0_SCR)
#define bfin_write_UART0_SCR(val) bfin_write16(UART0_SCR, val)
#define bfin_read_UART0_IER_SET() bfin_read16(UART0_IER_SET)
#define bfin_write_UART0_IER_SET(val) bfin_write16(UART0_IER_SET, val)
#define bfin_read_UART0_IER_CLEAR() bfin_read16(UART0_IER_CLEAR)
#define bfin_write_UART0_IER_CLEAR(val) bfin_write16(UART0_IER_CLEAR, val)
#define bfin_read_UART0_THR() bfin_read16(UART0_THR)
#define bfin_write_UART0_THR(val) bfin_write16(UART0_THR, val)
#define bfin_read_UART0_RBR() bfin_read16(UART0_RBR)
#define bfin_write_UART0_RBR(val) bfin_write16(UART0_RBR, val)
/* SPI0 Registers */
#define bfin_read_SPI0_CTL() bfin_read16(SPI0_CTL)
#define bfin_write_SPI0_CTL(val) bfin_write16(SPI0_CTL, val)
#define bfin_read_SPI0_FLG() bfin_read16(SPI0_FLG)
#define bfin_write_SPI0_FLG(val) bfin_write16(SPI0_FLG, val)
#define bfin_read_SPI0_STAT() bfin_read16(SPI0_STAT)
#define bfin_write_SPI0_STAT(val) bfin_write16(SPI0_STAT, val)
#define bfin_read_SPI0_TDBR() bfin_read16(SPI0_TDBR)
#define bfin_write_SPI0_TDBR(val) bfin_write16(SPI0_TDBR, val)
#define bfin_read_SPI0_RDBR() bfin_read16(SPI0_RDBR)
#define bfin_write_SPI0_RDBR(val) bfin_write16(SPI0_RDBR, val)
#define bfin_read_SPI0_BAUD() bfin_read16(SPI0_BAUD)
#define bfin_write_SPI0_BAUD(val) bfin_write16(SPI0_BAUD, val)
#define bfin_read_SPI0_SHADOW() bfin_read16(SPI0_SHADOW)
#define bfin_write_SPI0_SHADOW(val) bfin_write16(SPI0_SHADOW, val)
/* Timer Groubfin_read_() of 3 registers are not defined in the shared file because they are not available on the ADSP-BF542 processor */
/* Two Wire Interface Registers (TWI0) */
/* SPORT0 is not defined in the shared file because it is not available on the ADSP-BF542 and ADSP-BF544 bfin_read_()rocessors */
/* SPORT1 Registers */
#define bfin_read_SPORT1_TCR1() bfin_read16(SPORT1_TCR1)
#define bfin_write_SPORT1_TCR1(val) bfin_write16(SPORT1_TCR1, val)
#define bfin_read_SPORT1_TCR2() bfin_read16(SPORT1_TCR2)
#define bfin_write_SPORT1_TCR2(val) bfin_write16(SPORT1_TCR2, val)
#define bfin_read_SPORT1_TCLKDIV() bfin_read16(SPORT1_TCLKDIV)
#define bfin_write_SPORT1_TCLKDIV(val) bfin_write16(SPORT1_TCLKDIV, val)
#define bfin_read_SPORT1_TFSDIV() bfin_read16(SPORT1_TFSDIV)
#define bfin_write_SPORT1_TFSDIV(val) bfin_write16(SPORT1_TFSDIV, val)
#define bfin_read_SPORT1_TX() bfin_read32(SPORT1_TX)
#define bfin_write_SPORT1_TX(val) bfin_write32(SPORT1_TX, val)
#define bfin_read_SPORT1_RX() bfin_read32(SPORT1_RX)
#define bfin_write_SPORT1_RX(val) bfin_write32(SPORT1_RX, val)
#define bfin_read_SPORT1_RCR1() bfin_read16(SPORT1_RCR1)
#define bfin_write_SPORT1_RCR1(val) bfin_write16(SPORT1_RCR1, val)
#define bfin_read_SPORT1_RCR2() bfin_read16(SPORT1_RCR2)
#define bfin_write_SPORT1_RCR2(val) bfin_write16(SPORT1_RCR2, val)
#define bfin_read_SPORT1_RCLKDIV() bfin_read16(SPORT1_RCLKDIV)
#define bfin_write_SPORT1_RCLKDIV(val) bfin_write16(SPORT1_RCLKDIV, val)
#define bfin_read_SPORT1_RFSDIV() bfin_read16(SPORT1_RFSDIV)
#define bfin_write_SPORT1_RFSDIV(val) bfin_write16(SPORT1_RFSDIV, val)
#define bfin_read_SPORT1_STAT() bfin_read16(SPORT1_STAT)
#define bfin_write_SPORT1_STAT(val) bfin_write16(SPORT1_STAT, val)
#define bfin_read_SPORT1_CHNL() bfin_read16(SPORT1_CHNL)
#define bfin_write_SPORT1_CHNL(val) bfin_write16(SPORT1_CHNL, val)
#define bfin_read_SPORT1_MCMC1() bfin_read16(SPORT1_MCMC1)
#define bfin_write_SPORT1_MCMC1(val) bfin_write16(SPORT1_MCMC1, val)
#define bfin_read_SPORT1_MCMC2() bfin_read16(SPORT1_MCMC2)
#define bfin_write_SPORT1_MCMC2(val) bfin_write16(SPORT1_MCMC2, val)
#define bfin_read_SPORT1_MTCS0() bfin_read32(SPORT1_MTCS0)
#define bfin_write_SPORT1_MTCS0(val) bfin_write32(SPORT1_MTCS0, val)
#define bfin_read_SPORT1_MTCS1() bfin_read32(SPORT1_MTCS1)
#define bfin_write_SPORT1_MTCS1(val) bfin_write32(SPORT1_MTCS1, val)
#define bfin_read_SPORT1_MTCS2() bfin_read32(SPORT1_MTCS2)
#define bfin_write_SPORT1_MTCS2(val) bfin_write32(SPORT1_MTCS2, val)
#define bfin_read_SPORT1_MTCS3() bfin_read32(SPORT1_MTCS3)
#define bfin_write_SPORT1_MTCS3(val) bfin_write32(SPORT1_MTCS3, val)
#define bfin_read_SPORT1_MRCS0() bfin_read32(SPORT1_MRCS0)
#define bfin_write_SPORT1_MRCS0(val) bfin_write32(SPORT1_MRCS0, val)
#define bfin_read_SPORT1_MRCS1() bfin_read32(SPORT1_MRCS1)
#define bfin_write_SPORT1_MRCS1(val) bfin_write32(SPORT1_MRCS1, val)
#define bfin_read_SPORT1_MRCS2() bfin_read32(SPORT1_MRCS2)
#define bfin_write_SPORT1_MRCS2(val) bfin_write32(SPORT1_MRCS2, val)
#define bfin_read_SPORT1_MRCS3() bfin_read32(SPORT1_MRCS3)
#define bfin_write_SPORT1_MRCS3(val) bfin_write32(SPORT1_MRCS3, val)
/* Asynchronous Memory Control Registers */
#define bfin_read_EBIU_AMGCTL() bfin_read16(EBIU_AMGCTL)
#define bfin_write_EBIU_AMGCTL(val) bfin_write16(EBIU_AMGCTL, val)
#define bfin_read_EBIU_AMBCTL0() bfin_read32(EBIU_AMBCTL0)
#define bfin_write_EBIU_AMBCTL0(val) bfin_write32(EBIU_AMBCTL0, val)
#define bfin_read_EBIU_AMBCTL1() bfin_read32(EBIU_AMBCTL1)
#define bfin_write_EBIU_AMBCTL1(val) bfin_write32(EBIU_AMBCTL1, val)
#define bfin_read_EBIU_MBSCTL() bfin_read16(EBIU_MBSCTL)
#define bfin_write_EBIU_MBSCTL(val) bfin_write16(EBIU_MBSCTL, val)
#define bfin_read_EBIU_ARBSTAT() bfin_read32(EBIU_ARBSTAT)
#define bfin_write_EBIU_ARBSTAT(val) bfin_write32(EBIU_ARBSTAT, val)
#define bfin_read_EBIU_MODE() bfin_read32(EBIU_MODE)
#define bfin_write_EBIU_MODE(val) bfin_write32(EBIU_MODE, val)
#define bfin_read_EBIU_FCTL() bfin_read16(EBIU_FCTL)
#define bfin_write_EBIU_FCTL(val) bfin_write16(EBIU_FCTL, val)
/* DDR Memory Control Registers */
#define bfin_read_EBIU_DDRCTL0() bfin_read32(EBIU_DDRCTL0)
#define bfin_write_EBIU_DDRCTL0(val) bfin_write32(EBIU_DDRCTL0, val)
#define bfin_read_EBIU_DDRCTL1() bfin_read32(EBIU_DDRCTL1)
#define bfin_write_EBIU_DDRCTL1(val) bfin_write32(EBIU_DDRCTL1, val)
#define bfin_read_EBIU_DDRCTL2() bfin_read32(EBIU_DDRCTL2)
#define bfin_write_EBIU_DDRCTL2(val) bfin_write32(EBIU_DDRCTL2, val)
#define bfin_read_EBIU_DDRCTL3() bfin_read32(EBIU_DDRCTL3)
#define bfin_write_EBIU_DDRCTL3(val) bfin_write32(EBIU_DDRCTL3, val)
#define bfin_read_EBIU_DDRQUE() bfin_read32(EBIU_DDRQUE)
#define bfin_write_EBIU_DDRQUE(val) bfin_write32(EBIU_DDRQUE, val)
#define bfin_read_EBIU_ERRADD() bfin_read32(EBIU_ERRADD)
#define bfin_write_EBIU_ERRADD(val) bfin_write32(EBIU_ERRADD, val)
#define bfin_read_EBIU_ERRMST() bfin_read16(EBIU_ERRMST)
#define bfin_write_EBIU_ERRMST(val) bfin_write16(EBIU_ERRMST, val)
#define bfin_read_EBIU_RSTCTL() bfin_read16(EBIU_RSTCTL)
#define bfin_write_EBIU_RSTCTL(val) bfin_write16(EBIU_RSTCTL, val)
/* DDR BankRead and Write Count Registers */
#define bfin_read_EBIU_DDRBRC0() bfin_read32(EBIU_DDRBRC0)
#define bfin_write_EBIU_DDRBRC0(val) bfin_write32(EBIU_DDRBRC0, val)
#define bfin_read_EBIU_DDRBRC1() bfin_read32(EBIU_DDRBRC1)
#define bfin_write_EBIU_DDRBRC1(val) bfin_write32(EBIU_DDRBRC1, val)
#define bfin_read_EBIU_DDRBRC2() bfin_read32(EBIU_DDRBRC2)
#define bfin_write_EBIU_DDRBRC2(val) bfin_write32(EBIU_DDRBRC2, val)
#define bfin_read_EBIU_DDRBRC3() bfin_read32(EBIU_DDRBRC3)
#define bfin_write_EBIU_DDRBRC3(val) bfin_write32(EBIU_DDRBRC3, val)
#define bfin_read_EBIU_DDRBRC4() bfin_read32(EBIU_DDRBRC4)
#define bfin_write_EBIU_DDRBRC4(val) bfin_write32(EBIU_DDRBRC4, val)
#define bfin_read_EBIU_DDRBRC5() bfin_read32(EBIU_DDRBRC5)
#define bfin_write_EBIU_DDRBRC5(val) bfin_write32(EBIU_DDRBRC5, val)
#define bfin_read_EBIU_DDRBRC6() bfin_read32(EBIU_DDRBRC6)
#define bfin_write_EBIU_DDRBRC6(val) bfin_write32(EBIU_DDRBRC6, val)
#define bfin_read_EBIU_DDRBRC7() bfin_read32(EBIU_DDRBRC7)
#define bfin_write_EBIU_DDRBRC7(val) bfin_write32(EBIU_DDRBRC7, val)
#define bfin_read_EBIU_DDRBWC0() bfin_read32(EBIU_DDRBWC0)
#define bfin_write_EBIU_DDRBWC0(val) bfin_write32(EBIU_DDRBWC0, val)
#define bfin_read_EBIU_DDRBWC1() bfin_read32(EBIU_DDRBWC1)
#define bfin_write_EBIU_DDRBWC1(val) bfin_write32(EBIU_DDRBWC1, val)
#define bfin_read_EBIU_DDRBWC2() bfin_read32(EBIU_DDRBWC2)
#define bfin_write_EBIU_DDRBWC2(val) bfin_write32(EBIU_DDRBWC2, val)
#define bfin_read_EBIU_DDRBWC3() bfin_read32(EBIU_DDRBWC3)
#define bfin_write_EBIU_DDRBWC3(val) bfin_write32(EBIU_DDRBWC3, val)
#define bfin_read_EBIU_DDRBWC4() bfin_read32(EBIU_DDRBWC4)
#define bfin_write_EBIU_DDRBWC4(val) bfin_write32(EBIU_DDRBWC4, val)
#define bfin_read_EBIU_DDRBWC5() bfin_read32(EBIU_DDRBWC5)
#define bfin_write_EBIU_DDRBWC5(val) bfin_write32(EBIU_DDRBWC5, val)
#define bfin_read_EBIU_DDRBWC6() bfin_read32(EBIU_DDRBWC6)
#define bfin_write_EBIU_DDRBWC6(val) bfin_write32(EBIU_DDRBWC6, val)
#define bfin_read_EBIU_DDRBWC7() bfin_read32(EBIU_DDRBWC7)
#define bfin_write_EBIU_DDRBWC7(val) bfin_write32(EBIU_DDRBWC7, val)
#define bfin_read_EBIU_DDRACCT() bfin_read32(EBIU_DDRACCT)
#define bfin_write_EBIU_DDRACCT(val) bfin_write32(EBIU_DDRACCT, val)
#define bfin_read_EBIU_DDRTACT() bfin_read32(EBIU_DDRTACT)
#define bfin_write_EBIU_DDRTACT(val) bfin_write32(EBIU_DDRTACT, val)
#define bfin_read_EBIU_DDRARCT() bfin_read32(EBIU_DDRARCT)
#define bfin_write_EBIU_DDRARCT(val) bfin_write32(EBIU_DDRARCT, val)
#define bfin_read_EBIU_DDRGC0() bfin_read32(EBIU_DDRGC0)
#define bfin_write_EBIU_DDRGC0(val) bfin_write32(EBIU_DDRGC0, val)
#define bfin_read_EBIU_DDRGC1() bfin_read32(EBIU_DDRGC1)
#define bfin_write_EBIU_DDRGC1(val) bfin_write32(EBIU_DDRGC1, val)
#define bfin_read_EBIU_DDRGC2() bfin_read32(EBIU_DDRGC2)
#define bfin_write_EBIU_DDRGC2(val) bfin_write32(EBIU_DDRGC2, val)
#define bfin_read_EBIU_DDRGC3() bfin_read32(EBIU_DDRGC3)
#define bfin_write_EBIU_DDRGC3(val) bfin_write32(EBIU_DDRGC3, val)
#define bfin_read_EBIU_DDRMCEN() bfin_read32(EBIU_DDRMCEN)
#define bfin_write_EBIU_DDRMCEN(val) bfin_write32(EBIU_DDRMCEN, val)
#define bfin_read_EBIU_DDRMCCL() bfin_read32(EBIU_DDRMCCL)
#define bfin_write_EBIU_DDRMCCL(val) bfin_write32(EBIU_DDRMCCL, val)
/* DMAC0 Registers */
#define bfin_read_DMAC0_TC_PER() bfin_read16(DMAC0_TC_PER)
#define bfin_write_DMAC0_TC_PER(val) bfin_write16(DMAC0_TC_PER, val)
#define bfin_read_DMAC0_TC_CNT() bfin_read16(DMAC0_TC_CNT)
#define bfin_write_DMAC0_TC_CNT(val) bfin_write16(DMAC0_TC_CNT, val)
/* DMA Channel 0 Registers */
#define bfin_read_DMA0_NEXT_DESC_PTR() bfin_read32(DMA0_NEXT_DESC_PTR)
#define bfin_write_DMA0_NEXT_DESC_PTR(val) bfin_write32(DMA0_NEXT_DESC_PTR, val)
#define bfin_read_DMA0_START_ADDR() bfin_read32(DMA0_START_ADDR)
#define bfin_write_DMA0_START_ADDR(val) bfin_write32(DMA0_START_ADDR, val)
#define bfin_read_DMA0_CONFIG() bfin_read16(DMA0_CONFIG)
#define bfin_write_DMA0_CONFIG(val) bfin_write16(DMA0_CONFIG, val)
#define bfin_read_DMA0_X_COUNT() bfin_read16(DMA0_X_COUNT)
#define bfin_write_DMA0_X_COUNT(val) bfin_write16(DMA0_X_COUNT, val)
#define bfin_read_DMA0_X_MODIFY() bfin_read16(DMA0_X_MODIFY)
#define bfin_write_DMA0_X_MODIFY(val) bfin_write16(DMA0_X_MODIFY, val)
#define bfin_read_DMA0_Y_COUNT() bfin_read16(DMA0_Y_COUNT)
#define bfin_write_DMA0_Y_COUNT(val) bfin_write16(DMA0_Y_COUNT, val)
#define bfin_read_DMA0_Y_MODIFY() bfin_read16(DMA0_Y_MODIFY)
#define bfin_write_DMA0_Y_MODIFY(val) bfin_write16(DMA0_Y_MODIFY, val)
#define bfin_read_DMA0_CURR_DESC_PTR() bfin_read32(DMA0_CURR_DESC_PTR)
#define bfin_write_DMA0_CURR_DESC_PTR(val) bfin_write32(DMA0_CURR_DESC_PTR, val)
#define bfin_read_DMA0_CURR_ADDR() bfin_read32(DMA0_CURR_ADDR)
#define bfin_write_DMA0_CURR_ADDR(val) bfin_write32(DMA0_CURR_ADDR, val)
#define bfin_read_DMA0_IRQ_STATUS() bfin_read16(DMA0_IRQ_STATUS)
#define bfin_write_DMA0_IRQ_STATUS(val) bfin_write16(DMA0_IRQ_STATUS, val)
#define bfin_read_DMA0_PERIPHERAL_MAP() bfin_read16(DMA0_PERIPHERAL_MAP)
#define bfin_write_DMA0_PERIPHERAL_MAP(val) bfin_write16(DMA0_PERIPHERAL_MAP, val)
#define bfin_read_DMA0_CURR_X_COUNT() bfin_read16(DMA0_CURR_X_COUNT)
#define bfin_write_DMA0_CURR_X_COUNT(val) bfin_write16(DMA0_CURR_X_COUNT, val)
#define bfin_read_DMA0_CURR_Y_COUNT() bfin_read16(DMA0_CURR_Y_COUNT)
#define bfin_write_DMA0_CURR_Y_COUNT(val) bfin_write16(DMA0_CURR_Y_COUNT, val)
/* DMA Channel 1 Registers */
#define bfin_read_DMA1_NEXT_DESC_PTR() bfin_read32(DMA1_NEXT_DESC_PTR)
#define bfin_write_DMA1_NEXT_DESC_PTR(val) bfin_write32(DMA1_NEXT_DESC_PTR, val)
#define bfin_read_DMA1_START_ADDR() bfin_read32(DMA1_START_ADDR)
#define bfin_write_DMA1_START_ADDR(val) bfin_write32(DMA1_START_ADDR, val)
#define bfin_read_DMA1_CONFIG() bfin_read16(DMA1_CONFIG)
#define bfin_write_DMA1_CONFIG(val) bfin_write16(DMA1_CONFIG, val)
#define bfin_read_DMA1_X_COUNT() bfin_read16(DMA1_X_COUNT)
#define bfin_write_DMA1_X_COUNT(val) bfin_write16(DMA1_X_COUNT, val)
#define bfin_read_DMA1_X_MODIFY() bfin_read16(DMA1_X_MODIFY)
#define bfin_write_DMA1_X_MODIFY(val) bfin_write16(DMA1_X_MODIFY, val)
#define bfin_read_DMA1_Y_COUNT() bfin_read16(DMA1_Y_COUNT)
#define bfin_write_DMA1_Y_COUNT(val) bfin_write16(DMA1_Y_COUNT, val)
#define bfin_read_DMA1_Y_MODIFY() bfin_read16(DMA1_Y_MODIFY)
#define bfin_write_DMA1_Y_MODIFY(val) bfin_write16(DMA1_Y_MODIFY, val)
#define bfin_read_DMA1_CURR_DESC_PTR() bfin_read32(DMA1_CURR_DESC_PTR)
#define bfin_write_DMA1_CURR_DESC_PTR(val) bfin_write32(DMA1_CURR_DESC_PTR, val)
#define bfin_read_DMA1_CURR_ADDR() bfin_read32(DMA1_CURR_ADDR)
#define bfin_write_DMA1_CURR_ADDR(val) bfin_write32(DMA1_CURR_ADDR, val)
#define bfin_read_DMA1_IRQ_STATUS() bfin_read16(DMA1_IRQ_STATUS)
#define bfin_write_DMA1_IRQ_STATUS(val) bfin_write16(DMA1_IRQ_STATUS, val)
#define bfin_read_DMA1_PERIPHERAL_MAP() bfin_read16(DMA1_PERIPHERAL_MAP)
#define bfin_write_DMA1_PERIPHERAL_MAP(val) bfin_write16(DMA1_PERIPHERAL_MAP, val)
#define bfin_read_DMA1_CURR_X_COUNT() bfin_read16(DMA1_CURR_X_COUNT)
#define bfin_write_DMA1_CURR_X_COUNT(val) bfin_write16(DMA1_CURR_X_COUNT, val)
#define bfin_read_DMA1_CURR_Y_COUNT() bfin_read16(DMA1_CURR_Y_COUNT)
#define bfin_write_DMA1_CURR_Y_COUNT(val) bfin_write16(DMA1_CURR_Y_COUNT, val)
/* DMA Channel 2 Registers */
#define bfin_read_DMA2_NEXT_DESC_PTR() bfin_read32(DMA2_NEXT_DESC_PTR)
#define bfin_write_DMA2_NEXT_DESC_PTR(val) bfin_write32(DMA2_NEXT_DESC_PTR, val)
#define bfin_read_DMA2_START_ADDR() bfin_read32(DMA2_START_ADDR)
#define bfin_write_DMA2_START_ADDR(val) bfin_write32(DMA2_START_ADDR, val)
#define bfin_read_DMA2_CONFIG() bfin_read16(DMA2_CONFIG)
#define bfin_write_DMA2_CONFIG(val) bfin_write16(DMA2_CONFIG, val)
#define bfin_read_DMA2_X_COUNT() bfin_read16(DMA2_X_COUNT)
#define bfin_write_DMA2_X_COUNT(val) bfin_write16(DMA2_X_COUNT, val)
#define bfin_read_DMA2_X_MODIFY() bfin_read16(DMA2_X_MODIFY)
#define bfin_write_DMA2_X_MODIFY(val) bfin_write16(DMA2_X_MODIFY, val)
#define bfin_read_DMA2_Y_COUNT() bfin_read16(DMA2_Y_COUNT)
#define bfin_write_DMA2_Y_COUNT(val) bfin_write16(DMA2_Y_COUNT, val)
#define bfin_read_DMA2_Y_MODIFY() bfin_read16(DMA2_Y_MODIFY)
#define bfin_write_DMA2_Y_MODIFY(val) bfin_write16(DMA2_Y_MODIFY, val)
#define bfin_read_DMA2_CURR_DESC_PTR() bfin_read32(DMA2_CURR_DESC_PTR)
#define bfin_write_DMA2_CURR_DESC_PTR(val) bfin_write32(DMA2_CURR_DESC_PTR, val)
#define bfin_read_DMA2_CURR_ADDR() bfin_read32(DMA2_CURR_ADDR)
#define bfin_write_DMA2_CURR_ADDR(val) bfin_write32(DMA2_CURR_ADDR, val)
#define bfin_read_DMA2_IRQ_STATUS() bfin_read16(DMA2_IRQ_STATUS)
#define bfin_write_DMA2_IRQ_STATUS(val) bfin_write16(DMA2_IRQ_STATUS, val)
#define bfin_read_DMA2_PERIPHERAL_MAP() bfin_read16(DMA2_PERIPHERAL_MAP)
#define bfin_write_DMA2_PERIPHERAL_MAP(val) bfin_write16(DMA2_PERIPHERAL_MAP, val)
#define bfin_read_DMA2_CURR_X_COUNT() bfin_read16(DMA2_CURR_X_COUNT)
#define bfin_write_DMA2_CURR_X_COUNT(val) bfin_write16(DMA2_CURR_X_COUNT, val)
#define bfin_read_DMA2_CURR_Y_COUNT() bfin_read16(DMA2_CURR_Y_COUNT)
#define bfin_write_DMA2_CURR_Y_COUNT(val) bfin_write16(DMA2_CURR_Y_COUNT, val)
/* DMA Channel 3 Registers */
#define bfin_read_DMA3_NEXT_DESC_PTR() bfin_read32(DMA3_NEXT_DESC_PTR)
#define bfin_write_DMA3_NEXT_DESC_PTR(val) bfin_write32(DMA3_NEXT_DESC_PTR, val)
#define bfin_read_DMA3_START_ADDR() bfin_read32(DMA3_START_ADDR)
#define bfin_write_DMA3_START_ADDR(val) bfin_write32(DMA3_START_ADDR, val)
#define bfin_read_DMA3_CONFIG() bfin_read16(DMA3_CONFIG)
#define bfin_write_DMA3_CONFIG(val) bfin_write16(DMA3_CONFIG, val)
#define bfin_read_DMA3_X_COUNT() bfin_read16(DMA3_X_COUNT)
#define bfin_write_DMA3_X_COUNT(val) bfin_write16(DMA3_X_COUNT, val)
#define bfin_read_DMA3_X_MODIFY() bfin_read16(DMA3_X_MODIFY)
#define bfin_write_DMA3_X_MODIFY(val) bfin_write16(DMA3_X_MODIFY, val)
#define bfin_read_DMA3_Y_COUNT() bfin_read16(DMA3_Y_COUNT)
#define bfin_write_DMA3_Y_COUNT(val) bfin_write16(DMA3_Y_COUNT, val)
#define bfin_read_DMA3_Y_MODIFY() bfin_read16(DMA3_Y_MODIFY)
#define bfin_write_DMA3_Y_MODIFY(val) bfin_write16(DMA3_Y_MODIFY, val)
#define bfin_read_DMA3_CURR_DESC_PTR() bfin_read32(DMA3_CURR_DESC_PTR)
#define bfin_write_DMA3_CURR_DESC_PTR(val) bfin_write32(DMA3_CURR_DESC_PTR, val)
#define bfin_read_DMA3_CURR_ADDR() bfin_read32(DMA3_CURR_ADDR)
#define bfin_write_DMA3_CURR_ADDR(val) bfin_write32(DMA3_CURR_ADDR, val)
#define bfin_read_DMA3_IRQ_STATUS() bfin_read16(DMA3_IRQ_STATUS)
#define bfin_write_DMA3_IRQ_STATUS(val) bfin_write16(DMA3_IRQ_STATUS, val)
#define bfin_read_DMA3_PERIPHERAL_MAP() bfin_read16(DMA3_PERIPHERAL_MAP)
#define bfin_write_DMA3_PERIPHERAL_MAP(val) bfin_write16(DMA3_PERIPHERAL_MAP, val)
#define bfin_read_DMA3_CURR_X_COUNT() bfin_read16(DMA3_CURR_X_COUNT)
#define bfin_write_DMA3_CURR_X_COUNT(val) bfin_write16(DMA3_CURR_X_COUNT, val)
#define bfin_read_DMA3_CURR_Y_COUNT() bfin_read16(DMA3_CURR_Y_COUNT)
#define bfin_write_DMA3_CURR_Y_COUNT(val) bfin_write16(DMA3_CURR_Y_COUNT, val)
/* DMA Channel 4 Registers */
#define bfin_read_DMA4_NEXT_DESC_PTR() bfin_read32(DMA4_NEXT_DESC_PTR)
#define bfin_write_DMA4_NEXT_DESC_PTR(val) bfin_write32(DMA4_NEXT_DESC_PTR, val)
#define bfin_read_DMA4_START_ADDR() bfin_read32(DMA4_START_ADDR)
#define bfin_write_DMA4_START_ADDR(val) bfin_write32(DMA4_START_ADDR, val)
#define bfin_read_DMA4_CONFIG() bfin_read16(DMA4_CONFIG)
#define bfin_write_DMA4_CONFIG(val) bfin_write16(DMA4_CONFIG, val)
#define bfin_read_DMA4_X_COUNT() bfin_read16(DMA4_X_COUNT)
#define bfin_write_DMA4_X_COUNT(val) bfin_write16(DMA4_X_COUNT, val)
#define bfin_read_DMA4_X_MODIFY() bfin_read16(DMA4_X_MODIFY)
#define bfin_write_DMA4_X_MODIFY(val) bfin_write16(DMA4_X_MODIFY, val)
#define bfin_read_DMA4_Y_COUNT() bfin_read16(DMA4_Y_COUNT)
#define bfin_write_DMA4_Y_COUNT(val) bfin_write16(DMA4_Y_COUNT, val)
#define bfin_read_DMA4_Y_MODIFY() bfin_read16(DMA4_Y_MODIFY)
#define bfin_write_DMA4_Y_MODIFY(val) bfin_write16(DMA4_Y_MODIFY, val)
#define bfin_read_DMA4_CURR_DESC_PTR() bfin_read32(DMA4_CURR_DESC_PTR)
#define bfin_write_DMA4_CURR_DESC_PTR(val) bfin_write32(DMA4_CURR_DESC_PTR, val)
#define bfin_read_DMA4_CURR_ADDR() bfin_read32(DMA4_CURR_ADDR)
#define bfin_write_DMA4_CURR_ADDR(val) bfin_write32(DMA4_CURR_ADDR, val)
#define bfin_read_DMA4_IRQ_STATUS() bfin_read16(DMA4_IRQ_STATUS)
#define bfin_write_DMA4_IRQ_STATUS(val) bfin_write16(DMA4_IRQ_STATUS, val)
#define bfin_read_DMA4_PERIPHERAL_MAP() bfin_read16(DMA4_PERIPHERAL_MAP)
#define bfin_write_DMA4_PERIPHERAL_MAP(val) bfin_write16(DMA4_PERIPHERAL_MAP, val)
#define bfin_read_DMA4_CURR_X_COUNT() bfin_read16(DMA4_CURR_X_COUNT)
#define bfin_write_DMA4_CURR_X_COUNT(val) bfin_write16(DMA4_CURR_X_COUNT, val)
#define bfin_read_DMA4_CURR_Y_COUNT() bfin_read16(DMA4_CURR_Y_COUNT)
#define bfin_write_DMA4_CURR_Y_COUNT(val) bfin_write16(DMA4_CURR_Y_COUNT, val)
/* DMA Channel 5 Registers */
#define bfin_read_DMA5_NEXT_DESC_PTR() bfin_read32(DMA5_NEXT_DESC_PTR)
#define bfin_write_DMA5_NEXT_DESC_PTR(val) bfin_write32(DMA5_NEXT_DESC_PTR, val)
#define bfin_read_DMA5_START_ADDR() bfin_read32(DMA5_START_ADDR)
#define bfin_write_DMA5_START_ADDR(val) bfin_write32(DMA5_START_ADDR, val)
#define bfin_read_DMA5_CONFIG() bfin_read16(DMA5_CONFIG)
#define bfin_write_DMA5_CONFIG(val) bfin_write16(DMA5_CONFIG, val)
#define bfin_read_DMA5_X_COUNT() bfin_read16(DMA5_X_COUNT)
#define bfin_write_DMA5_X_COUNT(val) bfin_write16(DMA5_X_COUNT, val)
#define bfin_read_DMA5_X_MODIFY() bfin_read16(DMA5_X_MODIFY)
#define bfin_write_DMA5_X_MODIFY(val) bfin_write16(DMA5_X_MODIFY, val)
#define bfin_read_DMA5_Y_COUNT() bfin_read16(DMA5_Y_COUNT)
#define bfin_write_DMA5_Y_COUNT(val) bfin_write16(DMA5_Y_COUNT, val)
#define bfin_read_DMA5_Y_MODIFY() bfin_read16(DMA5_Y_MODIFY)
#define bfin_write_DMA5_Y_MODIFY(val) bfin_write16(DMA5_Y_MODIFY, val)
#define bfin_read_DMA5_CURR_DESC_PTR() bfin_read32(DMA5_CURR_DESC_PTR)
#define bfin_write_DMA5_CURR_DESC_PTR(val) bfin_write32(DMA5_CURR_DESC_PTR, val)
#define bfin_read_DMA5_CURR_ADDR() bfin_read32(DMA5_CURR_ADDR)
#define bfin_write_DMA5_CURR_ADDR(val) bfin_write32(DMA5_CURR_ADDR, val)
#define bfin_read_DMA5_IRQ_STATUS() bfin_read16(DMA5_IRQ_STATUS)
#define bfin_write_DMA5_IRQ_STATUS(val) bfin_write16(DMA5_IRQ_STATUS, val)
#define bfin_read_DMA5_PERIPHERAL_MAP() bfin_read16(DMA5_PERIPHERAL_MAP)
#define bfin_write_DMA5_PERIPHERAL_MAP(val) bfin_write16(DMA5_PERIPHERAL_MAP, val)
#define bfin_read_DMA5_CURR_X_COUNT() bfin_read16(DMA5_CURR_X_COUNT)
#define bfin_write_DMA5_CURR_X_COUNT(val) bfin_write16(DMA5_CURR_X_COUNT, val)
#define bfin_read_DMA5_CURR_Y_COUNT() bfin_read16(DMA5_CURR_Y_COUNT)
#define bfin_write_DMA5_CURR_Y_COUNT(val) bfin_write16(DMA5_CURR_Y_COUNT, val)
/* DMA Channel 6 Registers */
#define bfin_read_DMA6_NEXT_DESC_PTR() bfin_read32(DMA6_NEXT_DESC_PTR)
#define bfin_write_DMA6_NEXT_DESC_PTR(val) bfin_write32(DMA6_NEXT_DESC_PTR, val)
#define bfin_read_DMA6_START_ADDR() bfin_read32(DMA6_START_ADDR)
#define bfin_write_DMA6_START_ADDR(val) bfin_write32(DMA6_START_ADDR, val)
#define bfin_read_DMA6_CONFIG() bfin_read16(DMA6_CONFIG)
#define bfin_write_DMA6_CONFIG(val) bfin_write16(DMA6_CONFIG, val)
#define bfin_read_DMA6_X_COUNT() bfin_read16(DMA6_X_COUNT)
#define bfin_write_DMA6_X_COUNT(val) bfin_write16(DMA6_X_COUNT, val)
#define bfin_read_DMA6_X_MODIFY() bfin_read16(DMA6_X_MODIFY)
#define bfin_write_DMA6_X_MODIFY(val) bfin_write16(DMA6_X_MODIFY, val)
#define bfin_read_DMA6_Y_COUNT() bfin_read16(DMA6_Y_COUNT)
#define bfin_write_DMA6_Y_COUNT(val) bfin_write16(DMA6_Y_COUNT, val)
#define bfin_read_DMA6_Y_MODIFY() bfin_read16(DMA6_Y_MODIFY)
#define bfin_write_DMA6_Y_MODIFY(val) bfin_write16(DMA6_Y_MODIFY, val)
#define bfin_read_DMA6_CURR_DESC_PTR() bfin_read32(DMA6_CURR_DESC_PTR)
#define bfin_write_DMA6_CURR_DESC_PTR(val) bfin_write32(DMA6_CURR_DESC_PTR, val)
#define bfin_read_DMA6_CURR_ADDR() bfin_read32(DMA6_CURR_ADDR)
#define bfin_write_DMA6_CURR_ADDR(val) bfin_write32(DMA6_CURR_ADDR, val)
#define bfin_read_DMA6_IRQ_STATUS() bfin_read16(DMA6_IRQ_STATUS)
#define bfin_write_DMA6_IRQ_STATUS(val) bfin_write16(DMA6_IRQ_STATUS, val)
#define bfin_read_DMA6_PERIPHERAL_MAP() bfin_read16(DMA6_PERIPHERAL_MAP)
#define bfin_write_DMA6_PERIPHERAL_MAP(val) bfin_write16(DMA6_PERIPHERAL_MAP, val)
#define bfin_read_DMA6_CURR_X_COUNT() bfin_read16(DMA6_CURR_X_COUNT)
#define bfin_write_DMA6_CURR_X_COUNT(val) bfin_write16(DMA6_CURR_X_COUNT, val)
#define bfin_read_DMA6_CURR_Y_COUNT() bfin_read16(DMA6_CURR_Y_COUNT)
#define bfin_write_DMA6_CURR_Y_COUNT(val) bfin_write16(DMA6_CURR_Y_COUNT, val)
/* DMA Channel 7 Registers */
#define bfin_read_DMA7_NEXT_DESC_PTR() bfin_read32(DMA7_NEXT_DESC_PTR)
#define bfin_write_DMA7_NEXT_DESC_PTR(val) bfin_write32(DMA7_NEXT_DESC_PTR, val)
#define bfin_read_DMA7_START_ADDR() bfin_read32(DMA7_START_ADDR)
#define bfin_write_DMA7_START_ADDR(val) bfin_write32(DMA7_START_ADDR, val)
#define bfin_read_DMA7_CONFIG() bfin_read16(DMA7_CONFIG)
#define bfin_write_DMA7_CONFIG(val) bfin_write16(DMA7_CONFIG, val)
#define bfin_read_DMA7_X_COUNT() bfin_read16(DMA7_X_COUNT)
#define bfin_write_DMA7_X_COUNT(val) bfin_write16(DMA7_X_COUNT, val)
#define bfin_read_DMA7_X_MODIFY() bfin_read16(DMA7_X_MODIFY)
#define bfin_write_DMA7_X_MODIFY(val) bfin_write16(DMA7_X_MODIFY, val)
#define bfin_read_DMA7_Y_COUNT() bfin_read16(DMA7_Y_COUNT)
#define bfin_write_DMA7_Y_COUNT(val) bfin_write16(DMA7_Y_COUNT, val)
#define bfin_read_DMA7_Y_MODIFY() bfin_read16(DMA7_Y_MODIFY)
#define bfin_write_DMA7_Y_MODIFY(val) bfin_write16(DMA7_Y_MODIFY, val)
#define bfin_read_DMA7_CURR_DESC_PTR() bfin_read32(DMA7_CURR_DESC_PTR)
#define bfin_write_DMA7_CURR_DESC_PTR(val) bfin_write32(DMA7_CURR_DESC_PTR, val)
#define bfin_read_DMA7_CURR_ADDR() bfin_read32(DMA7_CURR_ADDR)
#define bfin_write_DMA7_CURR_ADDR(val) bfin_write32(DMA7_CURR_ADDR, val)
#define bfin_read_DMA7_IRQ_STATUS() bfin_read16(DMA7_IRQ_STATUS)
#define bfin_write_DMA7_IRQ_STATUS(val) bfin_write16(DMA7_IRQ_STATUS, val)
#define bfin_read_DMA7_PERIPHERAL_MAP() bfin_read16(DMA7_PERIPHERAL_MAP)
#define bfin_write_DMA7_PERIPHERAL_MAP(val) bfin_write16(DMA7_PERIPHERAL_MAP, val)
#define bfin_read_DMA7_CURR_X_COUNT() bfin_read16(DMA7_CURR_X_COUNT)
#define bfin_write_DMA7_CURR_X_COUNT(val) bfin_write16(DMA7_CURR_X_COUNT, val)
#define bfin_read_DMA7_CURR_Y_COUNT() bfin_read16(DMA7_CURR_Y_COUNT)
#define bfin_write_DMA7_CURR_Y_COUNT(val) bfin_write16(DMA7_CURR_Y_COUNT, val)
/* DMA Channel 8 Registers */
#define bfin_read_DMA8_NEXT_DESC_PTR() bfin_read32(DMA8_NEXT_DESC_PTR)
#define bfin_write_DMA8_NEXT_DESC_PTR(val) bfin_write32(DMA8_NEXT_DESC_PTR, val)
#define bfin_read_DMA8_START_ADDR() bfin_read32(DMA8_START_ADDR)
#define bfin_write_DMA8_START_ADDR(val) bfin_write32(DMA8_START_ADDR, val)
#define bfin_read_DMA8_CONFIG() bfin_read16(DMA8_CONFIG)
#define bfin_write_DMA8_CONFIG(val) bfin_write16(DMA8_CONFIG, val)
#define bfin_read_DMA8_X_COUNT() bfin_read16(DMA8_X_COUNT)
#define bfin_write_DMA8_X_COUNT(val) bfin_write16(DMA8_X_COUNT, val)
#define bfin_read_DMA8_X_MODIFY() bfin_read16(DMA8_X_MODIFY)
#define bfin_write_DMA8_X_MODIFY(val) bfin_write16(DMA8_X_MODIFY, val)
#define bfin_read_DMA8_Y_COUNT() bfin_read16(DMA8_Y_COUNT)
#define bfin_write_DMA8_Y_COUNT(val) bfin_write16(DMA8_Y_COUNT, val)
#define bfin_read_DMA8_Y_MODIFY() bfin_read16(DMA8_Y_MODIFY)
#define bfin_write_DMA8_Y_MODIFY(val) bfin_write16(DMA8_Y_MODIFY, val)
#define bfin_read_DMA8_CURR_DESC_PTR() bfin_read32(DMA8_CURR_DESC_PTR)
#define bfin_write_DMA8_CURR_DESC_PTR(val) bfin_write32(DMA8_CURR_DESC_PTR, val)
#define bfin_read_DMA8_CURR_ADDR() bfin_read32(DMA8_CURR_ADDR)
#define bfin_write_DMA8_CURR_ADDR(val) bfin_write32(DMA8_CURR_ADDR, val)
#define bfin_read_DMA8_IRQ_STATUS() bfin_read16(DMA8_IRQ_STATUS)
#define bfin_write_DMA8_IRQ_STATUS(val) bfin_write16(DMA8_IRQ_STATUS, val)
#define bfin_read_DMA8_PERIPHERAL_MAP() bfin_read16(DMA8_PERIPHERAL_MAP)
#define bfin_write_DMA8_PERIPHERAL_MAP(val) bfin_write16(DMA8_PERIPHERAL_MAP, val)
#define bfin_read_DMA8_CURR_X_COUNT() bfin_read16(DMA8_CURR_X_COUNT)
#define bfin_write_DMA8_CURR_X_COUNT(val) bfin_write16(DMA8_CURR_X_COUNT, val)
#define bfin_read_DMA8_CURR_Y_COUNT() bfin_read16(DMA8_CURR_Y_COUNT)
#define bfin_write_DMA8_CURR_Y_COUNT(val) bfin_write16(DMA8_CURR_Y_COUNT, val)
/* DMA Channel 9 Registers */
#define bfin_read_DMA9_NEXT_DESC_PTR() bfin_read32(DMA9_NEXT_DESC_PTR)
#define bfin_write_DMA9_NEXT_DESC_PTR(val) bfin_write32(DMA9_NEXT_DESC_PTR, val)
#define bfin_read_DMA9_START_ADDR() bfin_read32(DMA9_START_ADDR)
#define bfin_write_DMA9_START_ADDR(val) bfin_write32(DMA9_START_ADDR, val)
#define bfin_read_DMA9_CONFIG() bfin_read16(DMA9_CONFIG)
#define bfin_write_DMA9_CONFIG(val) bfin_write16(DMA9_CONFIG, val)
#define bfin_read_DMA9_X_COUNT() bfin_read16(DMA9_X_COUNT)
#define bfin_write_DMA9_X_COUNT(val) bfin_write16(DMA9_X_COUNT, val)
#define bfin_read_DMA9_X_MODIFY() bfin_read16(DMA9_X_MODIFY)
#define bfin_write_DMA9_X_MODIFY(val) bfin_write16(DMA9_X_MODIFY, val)
#define bfin_read_DMA9_Y_COUNT() bfin_read16(DMA9_Y_COUNT)
#define bfin_write_DMA9_Y_COUNT(val) bfin_write16(DMA9_Y_COUNT, val)
#define bfin_read_DMA9_Y_MODIFY() bfin_read16(DMA9_Y_MODIFY)
#define bfin_write_DMA9_Y_MODIFY(val) bfin_write16(DMA9_Y_MODIFY, val)
#define bfin_read_DMA9_CURR_DESC_PTR() bfin_read32(DMA9_CURR_DESC_PTR)
#define bfin_write_DMA9_CURR_DESC_PTR(val) bfin_write32(DMA9_CURR_DESC_PTR, val)
#define bfin_read_DMA9_CURR_ADDR() bfin_read32(DMA9_CURR_ADDR)
#define bfin_write_DMA9_CURR_ADDR(val) bfin_write32(DMA9_CURR_ADDR, val)
#define bfin_read_DMA9_IRQ_STATUS() bfin_read16(DMA9_IRQ_STATUS)
#define bfin_write_DMA9_IRQ_STATUS(val) bfin_write16(DMA9_IRQ_STATUS, val)
#define bfin_read_DMA9_PERIPHERAL_MAP() bfin_read16(DMA9_PERIPHERAL_MAP)
#define bfin_write_DMA9_PERIPHERAL_MAP(val) bfin_write16(DMA9_PERIPHERAL_MAP, val)
#define bfin_read_DMA9_CURR_X_COUNT() bfin_read16(DMA9_CURR_X_COUNT)
#define bfin_write_DMA9_CURR_X_COUNT(val) bfin_write16(DMA9_CURR_X_COUNT, val)
#define bfin_read_DMA9_CURR_Y_COUNT() bfin_read16(DMA9_CURR_Y_COUNT)
#define bfin_write_DMA9_CURR_Y_COUNT(val) bfin_write16(DMA9_CURR_Y_COUNT, val)
/* DMA Channel 10 Registers */
#define bfin_read_DMA10_NEXT_DESC_PTR() bfin_read32(DMA10_NEXT_DESC_PTR)
#define bfin_write_DMA10_NEXT_DESC_PTR(val) bfin_write32(DMA10_NEXT_DESC_PTR, val)
#define bfin_read_DMA10_START_ADDR() bfin_read32(DMA10_START_ADDR)
#define bfin_write_DMA10_START_ADDR(val) bfin_write32(DMA10_START_ADDR, val)
#define bfin_read_DMA10_CONFIG() bfin_read16(DMA10_CONFIG)
#define bfin_write_DMA10_CONFIG(val) bfin_write16(DMA10_CONFIG, val)
#define bfin_read_DMA10_X_COUNT() bfin_read16(DMA10_X_COUNT)
#define bfin_write_DMA10_X_COUNT(val) bfin_write16(DMA10_X_COUNT, val)
#define bfin_read_DMA10_X_MODIFY() bfin_read16(DMA10_X_MODIFY)
#define bfin_write_DMA10_X_MODIFY(val) bfin_write16(DMA10_X_MODIFY, val)
#define bfin_read_DMA10_Y_COUNT() bfin_read16(DMA10_Y_COUNT)
#define bfin_write_DMA10_Y_COUNT(val) bfin_write16(DMA10_Y_COUNT, val)
#define bfin_read_DMA10_Y_MODIFY() bfin_read16(DMA10_Y_MODIFY)
#define bfin_write_DMA10_Y_MODIFY(val) bfin_write16(DMA10_Y_MODIFY, val)
#define bfin_read_DMA10_CURR_DESC_PTR() bfin_read32(DMA10_CURR_DESC_PTR)
#define bfin_write_DMA10_CURR_DESC_PTR(val) bfin_write32(DMA10_CURR_DESC_PTR, val)
#define bfin_read_DMA10_CURR_ADDR() bfin_read32(DMA10_CURR_ADDR)
#define bfin_write_DMA10_CURR_ADDR(val) bfin_write32(DMA10_CURR_ADDR, val)
#define bfin_read_DMA10_IRQ_STATUS() bfin_read16(DMA10_IRQ_STATUS)
#define bfin_write_DMA10_IRQ_STATUS(val) bfin_write16(DMA10_IRQ_STATUS, val)
#define bfin_read_DMA10_PERIPHERAL_MAP() bfin_read16(DMA10_PERIPHERAL_MAP)
#define bfin_write_DMA10_PERIPHERAL_MAP(val) bfin_write16(DMA10_PERIPHERAL_MAP, val)
#define bfin_read_DMA10_CURR_X_COUNT() bfin_read16(DMA10_CURR_X_COUNT)
#define bfin_write_DMA10_CURR_X_COUNT(val) bfin_write16(DMA10_CURR_X_COUNT, val)
#define bfin_read_DMA10_CURR_Y_COUNT() bfin_read16(DMA10_CURR_Y_COUNT)
#define bfin_write_DMA10_CURR_Y_COUNT(val) bfin_write16(DMA10_CURR_Y_COUNT, val)
/* DMA Channel 11 Registers */
#define bfin_read_DMA11_NEXT_DESC_PTR() bfin_read32(DMA11_NEXT_DESC_PTR)
#define bfin_write_DMA11_NEXT_DESC_PTR(val) bfin_write32(DMA11_NEXT_DESC_PTR, val)
#define bfin_read_DMA11_START_ADDR() bfin_read32(DMA11_START_ADDR)
#define bfin_write_DMA11_START_ADDR(val) bfin_write32(DMA11_START_ADDR, val)
#define bfin_read_DMA11_CONFIG() bfin_read16(DMA11_CONFIG)
#define bfin_write_DMA11_CONFIG(val) bfin_write16(DMA11_CONFIG, val)
#define bfin_read_DMA11_X_COUNT() bfin_read16(DMA11_X_COUNT)
#define bfin_write_DMA11_X_COUNT(val) bfin_write16(DMA11_X_COUNT, val)
#define bfin_read_DMA11_X_MODIFY() bfin_read16(DMA11_X_MODIFY)
#define bfin_write_DMA11_X_MODIFY(val) bfin_write16(DMA11_X_MODIFY, val)
#define bfin_read_DMA11_Y_COUNT() bfin_read16(DMA11_Y_COUNT)
#define bfin_write_DMA11_Y_COUNT(val) bfin_write16(DMA11_Y_COUNT, val)
#define bfin_read_DMA11_Y_MODIFY() bfin_read16(DMA11_Y_MODIFY)
#define bfin_write_DMA11_Y_MODIFY(val) bfin_write16(DMA11_Y_MODIFY, val)
#define bfin_read_DMA11_CURR_DESC_PTR() bfin_read32(DMA11_CURR_DESC_PTR)
#define bfin_write_DMA11_CURR_DESC_PTR(val) bfin_write32(DMA11_CURR_DESC_PTR, val)
#define bfin_read_DMA11_CURR_ADDR() bfin_read32(DMA11_CURR_ADDR)
#define bfin_write_DMA11_CURR_ADDR(val) bfin_write32(DMA11_CURR_ADDR, val)
#define bfin_read_DMA11_IRQ_STATUS() bfin_read16(DMA11_IRQ_STATUS)
#define bfin_write_DMA11_IRQ_STATUS(val) bfin_write16(DMA11_IRQ_STATUS, val)
#define bfin_read_DMA11_PERIPHERAL_MAP() bfin_read16(DMA11_PERIPHERAL_MAP)
#define bfin_write_DMA11_PERIPHERAL_MAP(val) bfin_write16(DMA11_PERIPHERAL_MAP, val)
#define bfin_read_DMA11_CURR_X_COUNT() bfin_read16(DMA11_CURR_X_COUNT)
#define bfin_write_DMA11_CURR_X_COUNT(val) bfin_write16(DMA11_CURR_X_COUNT, val)
#define bfin_read_DMA11_CURR_Y_COUNT() bfin_read16(DMA11_CURR_Y_COUNT)
#define bfin_write_DMA11_CURR_Y_COUNT(val) bfin_write16(DMA11_CURR_Y_COUNT, val)
/* MDMA Stream 0 Registers */
#define bfin_read_MDMA_D0_NEXT_DESC_PTR() bfin_read32(MDMA_D0_NEXT_DESC_PTR)
#define bfin_write_MDMA_D0_NEXT_DESC_PTR(val) bfin_write32(MDMA_D0_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_D0_START_ADDR() bfin_read32(MDMA_D0_START_ADDR)
#define bfin_write_MDMA_D0_START_ADDR(val) bfin_write32(MDMA_D0_START_ADDR, val)
#define bfin_read_MDMA_D0_CONFIG() bfin_read16(MDMA_D0_CONFIG)
#define bfin_write_MDMA_D0_CONFIG(val) bfin_write16(MDMA_D0_CONFIG, val)
#define bfin_read_MDMA_D0_X_COUNT() bfin_read16(MDMA_D0_X_COUNT)
#define bfin_write_MDMA_D0_X_COUNT(val) bfin_write16(MDMA_D0_X_COUNT, val)
#define bfin_read_MDMA_D0_X_MODIFY() bfin_read16(MDMA_D0_X_MODIFY)
#define bfin_write_MDMA_D0_X_MODIFY(val) bfin_write16(MDMA_D0_X_MODIFY, val)
#define bfin_read_MDMA_D0_Y_COUNT() bfin_read16(MDMA_D0_Y_COUNT)
#define bfin_write_MDMA_D0_Y_COUNT(val) bfin_write16(MDMA_D0_Y_COUNT, val)
#define bfin_read_MDMA_D0_Y_MODIFY() bfin_read16(MDMA_D0_Y_MODIFY)
#define bfin_write_MDMA_D0_Y_MODIFY(val) bfin_write16(MDMA_D0_Y_MODIFY, val)
#define bfin_read_MDMA_D0_CURR_DESC_PTR() bfin_read32(MDMA_D0_CURR_DESC_PTR)
#define bfin_write_MDMA_D0_CURR_DESC_PTR(val) bfin_write32(MDMA_D0_CURR_DESC_PTR, val)
#define bfin_read_MDMA_D0_CURR_ADDR() bfin_read32(MDMA_D0_CURR_ADDR)
#define bfin_write_MDMA_D0_CURR_ADDR(val) bfin_write32(MDMA_D0_CURR_ADDR, val)
#define bfin_read_MDMA_D0_IRQ_STATUS() bfin_read16(MDMA_D0_IRQ_STATUS)
#define bfin_write_MDMA_D0_IRQ_STATUS(val) bfin_write16(MDMA_D0_IRQ_STATUS, val)
#define bfin_read_MDMA_D0_PERIPHERAL_MAP() bfin_read16(MDMA_D0_PERIPHERAL_MAP)
#define bfin_write_MDMA_D0_PERIPHERAL_MAP(val) bfin_write16(MDMA_D0_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_D0_CURR_X_COUNT() bfin_read16(MDMA_D0_CURR_X_COUNT)
#define bfin_write_MDMA_D0_CURR_X_COUNT(val) bfin_write16(MDMA_D0_CURR_X_COUNT, val)
#define bfin_read_MDMA_D0_CURR_Y_COUNT() bfin_read16(MDMA_D0_CURR_Y_COUNT)
#define bfin_write_MDMA_D0_CURR_Y_COUNT(val) bfin_write16(MDMA_D0_CURR_Y_COUNT, val)
#define bfin_read_MDMA_S0_NEXT_DESC_PTR() bfin_read32(MDMA_S0_NEXT_DESC_PTR)
#define bfin_write_MDMA_S0_NEXT_DESC_PTR(val) bfin_write32(MDMA_S0_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_S0_START_ADDR() bfin_read32(MDMA_S0_START_ADDR)
#define bfin_write_MDMA_S0_START_ADDR(val) bfin_write32(MDMA_S0_START_ADDR, val)
#define bfin_read_MDMA_S0_CONFIG() bfin_read16(MDMA_S0_CONFIG)
#define bfin_write_MDMA_S0_CONFIG(val) bfin_write16(MDMA_S0_CONFIG, val)
#define bfin_read_MDMA_S0_X_COUNT() bfin_read16(MDMA_S0_X_COUNT)
#define bfin_write_MDMA_S0_X_COUNT(val) bfin_write16(MDMA_S0_X_COUNT, val)
#define bfin_read_MDMA_S0_X_MODIFY() bfin_read16(MDMA_S0_X_MODIFY)
#define bfin_write_MDMA_S0_X_MODIFY(val) bfin_write16(MDMA_S0_X_MODIFY, val)
#define bfin_read_MDMA_S0_Y_COUNT() bfin_read16(MDMA_S0_Y_COUNT)
#define bfin_write_MDMA_S0_Y_COUNT(val) bfin_write16(MDMA_S0_Y_COUNT, val)
#define bfin_read_MDMA_S0_Y_MODIFY() bfin_read16(MDMA_S0_Y_MODIFY)
#define bfin_write_MDMA_S0_Y_MODIFY(val) bfin_write16(MDMA_S0_Y_MODIFY, val)
#define bfin_read_MDMA_S0_CURR_DESC_PTR() bfin_read32(MDMA_S0_CURR_DESC_PTR)
#define bfin_write_MDMA_S0_CURR_DESC_PTR(val) bfin_write32(MDMA_S0_CURR_DESC_PTR, val)
#define bfin_read_MDMA_S0_CURR_ADDR() bfin_read32(MDMA_S0_CURR_ADDR)
#define bfin_write_MDMA_S0_CURR_ADDR(val) bfin_write32(MDMA_S0_CURR_ADDR, val)
#define bfin_read_MDMA_S0_IRQ_STATUS() bfin_read16(MDMA_S0_IRQ_STATUS)
#define bfin_write_MDMA_S0_IRQ_STATUS(val) bfin_write16(MDMA_S0_IRQ_STATUS, val)
#define bfin_read_MDMA_S0_PERIPHERAL_MAP() bfin_read16(MDMA_S0_PERIPHERAL_MAP)
#define bfin_write_MDMA_S0_PERIPHERAL_MAP(val) bfin_write16(MDMA_S0_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_S0_CURR_X_COUNT() bfin_read16(MDMA_S0_CURR_X_COUNT)
#define bfin_write_MDMA_S0_CURR_X_COUNT(val) bfin_write16(MDMA_S0_CURR_X_COUNT, val)
#define bfin_read_MDMA_S0_CURR_Y_COUNT() bfin_read16(MDMA_S0_CURR_Y_COUNT)
#define bfin_write_MDMA_S0_CURR_Y_COUNT(val) bfin_write16(MDMA_S0_CURR_Y_COUNT, val)
/* MDMA Stream 1 Registers */
#define bfin_read_MDMA_D1_NEXT_DESC_PTR() bfin_read32(MDMA_D1_NEXT_DESC_PTR)
#define bfin_write_MDMA_D1_NEXT_DESC_PTR(val) bfin_write32(MDMA_D1_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_D1_START_ADDR() bfin_read32(MDMA_D1_START_ADDR)
#define bfin_write_MDMA_D1_START_ADDR(val) bfin_write32(MDMA_D1_START_ADDR, val)
#define bfin_read_MDMA_D1_CONFIG() bfin_read16(MDMA_D1_CONFIG)
#define bfin_write_MDMA_D1_CONFIG(val) bfin_write16(MDMA_D1_CONFIG, val)
#define bfin_read_MDMA_D1_X_COUNT() bfin_read16(MDMA_D1_X_COUNT)
#define bfin_write_MDMA_D1_X_COUNT(val) bfin_write16(MDMA_D1_X_COUNT, val)
#define bfin_read_MDMA_D1_X_MODIFY() bfin_read16(MDMA_D1_X_MODIFY)
#define bfin_write_MDMA_D1_X_MODIFY(val) bfin_write16(MDMA_D1_X_MODIFY, val)
#define bfin_read_MDMA_D1_Y_COUNT() bfin_read16(MDMA_D1_Y_COUNT)
#define bfin_write_MDMA_D1_Y_COUNT(val) bfin_write16(MDMA_D1_Y_COUNT, val)
#define bfin_read_MDMA_D1_Y_MODIFY() bfin_read16(MDMA_D1_Y_MODIFY)
#define bfin_write_MDMA_D1_Y_MODIFY(val) bfin_write16(MDMA_D1_Y_MODIFY, val)
#define bfin_read_MDMA_D1_CURR_DESC_PTR() bfin_read32(MDMA_D1_CURR_DESC_PTR)
#define bfin_write_MDMA_D1_CURR_DESC_PTR(val) bfin_write32(MDMA_D1_CURR_DESC_PTR, val)
#define bfin_read_MDMA_D1_CURR_ADDR() bfin_read32(MDMA_D1_CURR_ADDR)
#define bfin_write_MDMA_D1_CURR_ADDR(val) bfin_write32(MDMA_D1_CURR_ADDR, val)
#define bfin_read_MDMA_D1_IRQ_STATUS() bfin_read16(MDMA_D1_IRQ_STATUS)
#define bfin_write_MDMA_D1_IRQ_STATUS(val) bfin_write16(MDMA_D1_IRQ_STATUS, val)
#define bfin_read_MDMA_D1_PERIPHERAL_MAP() bfin_read16(MDMA_D1_PERIPHERAL_MAP)
#define bfin_write_MDMA_D1_PERIPHERAL_MAP(val) bfin_write16(MDMA_D1_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_D1_CURR_X_COUNT() bfin_read16(MDMA_D1_CURR_X_COUNT)
#define bfin_write_MDMA_D1_CURR_X_COUNT(val) bfin_write16(MDMA_D1_CURR_X_COUNT, val)
#define bfin_read_MDMA_D1_CURR_Y_COUNT() bfin_read16(MDMA_D1_CURR_Y_COUNT)
#define bfin_write_MDMA_D1_CURR_Y_COUNT(val) bfin_write16(MDMA_D1_CURR_Y_COUNT, val)
#define bfin_read_MDMA_S1_NEXT_DESC_PTR() bfin_read32(MDMA_S1_NEXT_DESC_PTR)
#define bfin_write_MDMA_S1_NEXT_DESC_PTR(val) bfin_write32(MDMA_S1_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_S1_START_ADDR() bfin_read32(MDMA_S1_START_ADDR)
#define bfin_write_MDMA_S1_START_ADDR(val) bfin_write32(MDMA_S1_START_ADDR, val)
#define bfin_read_MDMA_S1_CONFIG() bfin_read16(MDMA_S1_CONFIG)
#define bfin_write_MDMA_S1_CONFIG(val) bfin_write16(MDMA_S1_CONFIG, val)
#define bfin_read_MDMA_S1_X_COUNT() bfin_read16(MDMA_S1_X_COUNT)
#define bfin_write_MDMA_S1_X_COUNT(val) bfin_write16(MDMA_S1_X_COUNT, val)
#define bfin_read_MDMA_S1_X_MODIFY() bfin_read16(MDMA_S1_X_MODIFY)
#define bfin_write_MDMA_S1_X_MODIFY(val) bfin_write16(MDMA_S1_X_MODIFY, val)
#define bfin_read_MDMA_S1_Y_COUNT() bfin_read16(MDMA_S1_Y_COUNT)
#define bfin_write_MDMA_S1_Y_COUNT(val) bfin_write16(MDMA_S1_Y_COUNT, val)
#define bfin_read_MDMA_S1_Y_MODIFY() bfin_read16(MDMA_S1_Y_MODIFY)
#define bfin_write_MDMA_S1_Y_MODIFY(val) bfin_write16(MDMA_S1_Y_MODIFY, val)
#define bfin_read_MDMA_S1_CURR_DESC_PTR() bfin_read32(MDMA_S1_CURR_DESC_PTR)
#define bfin_write_MDMA_S1_CURR_DESC_PTR(val) bfin_write32(MDMA_S1_CURR_DESC_PTR, val)
#define bfin_read_MDMA_S1_CURR_ADDR() bfin_read32(MDMA_S1_CURR_ADDR)
#define bfin_write_MDMA_S1_CURR_ADDR(val) bfin_write32(MDMA_S1_CURR_ADDR, val)
#define bfin_read_MDMA_S1_IRQ_STATUS() bfin_read16(MDMA_S1_IRQ_STATUS)
#define bfin_write_MDMA_S1_IRQ_STATUS(val) bfin_write16(MDMA_S1_IRQ_STATUS, val)
#define bfin_read_MDMA_S1_PERIPHERAL_MAP() bfin_read16(MDMA_S1_PERIPHERAL_MAP)
#define bfin_write_MDMA_S1_PERIPHERAL_MAP(val) bfin_write16(MDMA_S1_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_S1_CURR_X_COUNT() bfin_read16(MDMA_S1_CURR_X_COUNT)
#define bfin_write_MDMA_S1_CURR_X_COUNT(val) bfin_write16(MDMA_S1_CURR_X_COUNT, val)
#define bfin_read_MDMA_S1_CURR_Y_COUNT() bfin_read16(MDMA_S1_CURR_Y_COUNT)
#define bfin_write_MDMA_S1_CURR_Y_COUNT(val) bfin_write16(MDMA_S1_CURR_Y_COUNT, val)
/* EPPI1 Registers */
#define bfin_read_EPPI1_STATUS() bfin_read16(EPPI1_STATUS)
#define bfin_write_EPPI1_STATUS(val) bfin_write16(EPPI1_STATUS, val)
#define bfin_read_EPPI1_HCOUNT() bfin_read16(EPPI1_HCOUNT)
#define bfin_write_EPPI1_HCOUNT(val) bfin_write16(EPPI1_HCOUNT, val)
#define bfin_read_EPPI1_HDELAY() bfin_read16(EPPI1_HDELAY)
#define bfin_write_EPPI1_HDELAY(val) bfin_write16(EPPI1_HDELAY, val)
#define bfin_read_EPPI1_VCOUNT() bfin_read16(EPPI1_VCOUNT)
#define bfin_write_EPPI1_VCOUNT(val) bfin_write16(EPPI1_VCOUNT, val)
#define bfin_read_EPPI1_VDELAY() bfin_read16(EPPI1_VDELAY)
#define bfin_write_EPPI1_VDELAY(val) bfin_write16(EPPI1_VDELAY, val)
#define bfin_read_EPPI1_FRAME() bfin_read16(EPPI1_FRAME)
#define bfin_write_EPPI1_FRAME(val) bfin_write16(EPPI1_FRAME, val)
#define bfin_read_EPPI1_LINE() bfin_read16(EPPI1_LINE)
#define bfin_write_EPPI1_LINE(val) bfin_write16(EPPI1_LINE, val)
#define bfin_read_EPPI1_CLKDIV() bfin_read16(EPPI1_CLKDIV)
#define bfin_write_EPPI1_CLKDIV(val) bfin_write16(EPPI1_CLKDIV, val)
#define bfin_read_EPPI1_CONTROL() bfin_read32(EPPI1_CONTROL)
#define bfin_write_EPPI1_CONTROL(val) bfin_write32(EPPI1_CONTROL, val)
#define bfin_read_EPPI1_FS1W_HBL() bfin_read32(EPPI1_FS1W_HBL)
#define bfin_write_EPPI1_FS1W_HBL(val) bfin_write32(EPPI1_FS1W_HBL, val)
#define bfin_read_EPPI1_FS1P_AVPL() bfin_read32(EPPI1_FS1P_AVPL)
#define bfin_write_EPPI1_FS1P_AVPL(val) bfin_write32(EPPI1_FS1P_AVPL, val)
#define bfin_read_EPPI1_FS2W_LVB() bfin_read32(EPPI1_FS2W_LVB)
#define bfin_write_EPPI1_FS2W_LVB(val) bfin_write32(EPPI1_FS2W_LVB, val)
#define bfin_read_EPPI1_FS2P_LAVF() bfin_read32(EPPI1_FS2P_LAVF)
#define bfin_write_EPPI1_FS2P_LAVF(val) bfin_write32(EPPI1_FS2P_LAVF, val)
#define bfin_read_EPPI1_CLIP() bfin_read32(EPPI1_CLIP)
#define bfin_write_EPPI1_CLIP(val) bfin_write32(EPPI1_CLIP, val)
/* Port Interrubfin_read_()t 0 Registers (32-bit) */
#define bfin_read_PINT0_MASK_SET() bfin_read32(PINT0_MASK_SET)
#define bfin_write_PINT0_MASK_SET(val) bfin_write32(PINT0_MASK_SET, val)
#define bfin_read_PINT0_MASK_CLEAR() bfin_read32(PINT0_MASK_CLEAR)
#define bfin_write_PINT0_MASK_CLEAR(val) bfin_write32(PINT0_MASK_CLEAR, val)
#define bfin_read_PINT0_REQUEST() bfin_read32(PINT0_REQUEST)
#define bfin_write_PINT0_REQUEST(val) bfin_write32(PINT0_REQUEST, val)
#define bfin_read_PINT0_ASSIGN() bfin_read32(PINT0_ASSIGN)
#define bfin_write_PINT0_ASSIGN(val) bfin_write32(PINT0_ASSIGN, val)
#define bfin_read_PINT0_EDGE_SET() bfin_read32(PINT0_EDGE_SET)
#define bfin_write_PINT0_EDGE_SET(val) bfin_write32(PINT0_EDGE_SET, val)
#define bfin_read_PINT0_EDGE_CLEAR() bfin_read32(PINT0_EDGE_CLEAR)
#define bfin_write_PINT0_EDGE_CLEAR(val) bfin_write32(PINT0_EDGE_CLEAR, val)
#define bfin_read_PINT0_INVERT_SET() bfin_read32(PINT0_INVERT_SET)
#define bfin_write_PINT0_INVERT_SET(val) bfin_write32(PINT0_INVERT_SET, val)
#define bfin_read_PINT0_INVERT_CLEAR() bfin_read32(PINT0_INVERT_CLEAR)
#define bfin_write_PINT0_INVERT_CLEAR(val) bfin_write32(PINT0_INVERT_CLEAR, val)
#define bfin_read_PINT0_PINSTATE() bfin_read32(PINT0_PINSTATE)
#define bfin_write_PINT0_PINSTATE(val) bfin_write32(PINT0_PINSTATE, val)
#define bfin_read_PINT0_LATCH() bfin_read32(PINT0_LATCH)
#define bfin_write_PINT0_LATCH(val) bfin_write32(PINT0_LATCH, val)
/* Port Interrubfin_read_()t 1 Registers (32-bit) */
#define bfin_read_PINT1_MASK_SET() bfin_read32(PINT1_MASK_SET)
#define bfin_write_PINT1_MASK_SET(val) bfin_write32(PINT1_MASK_SET, val)
#define bfin_read_PINT1_MASK_CLEAR() bfin_read32(PINT1_MASK_CLEAR)
#define bfin_write_PINT1_MASK_CLEAR(val) bfin_write32(PINT1_MASK_CLEAR, val)
#define bfin_read_PINT1_REQUEST() bfin_read32(PINT1_REQUEST)
#define bfin_write_PINT1_REQUEST(val) bfin_write32(PINT1_REQUEST, val)
#define bfin_read_PINT1_ASSIGN() bfin_read32(PINT1_ASSIGN)
#define bfin_write_PINT1_ASSIGN(val) bfin_write32(PINT1_ASSIGN, val)
#define bfin_read_PINT1_EDGE_SET() bfin_read32(PINT1_EDGE_SET)
#define bfin_write_PINT1_EDGE_SET(val) bfin_write32(PINT1_EDGE_SET, val)
#define bfin_read_PINT1_EDGE_CLEAR() bfin_read32(PINT1_EDGE_CLEAR)
#define bfin_write_PINT1_EDGE_CLEAR(val) bfin_write32(PINT1_EDGE_CLEAR, val)
#define bfin_read_PINT1_INVERT_SET() bfin_read32(PINT1_INVERT_SET)
#define bfin_write_PINT1_INVERT_SET(val) bfin_write32(PINT1_INVERT_SET, val)
#define bfin_read_PINT1_INVERT_CLEAR() bfin_read32(PINT1_INVERT_CLEAR)
#define bfin_write_PINT1_INVERT_CLEAR(val) bfin_write32(PINT1_INVERT_CLEAR, val)
#define bfin_read_PINT1_PINSTATE() bfin_read32(PINT1_PINSTATE)
#define bfin_write_PINT1_PINSTATE(val) bfin_write32(PINT1_PINSTATE, val)
#define bfin_read_PINT1_LATCH() bfin_read32(PINT1_LATCH)
#define bfin_write_PINT1_LATCH(val) bfin_write32(PINT1_LATCH, val)
/* Port Interrubfin_read_()t 2 Registers (32-bit) */
#define bfin_read_PINT2_MASK_SET() bfin_read32(PINT2_MASK_SET)
#define bfin_write_PINT2_MASK_SET(val) bfin_write32(PINT2_MASK_SET, val)
#define bfin_read_PINT2_MASK_CLEAR() bfin_read32(PINT2_MASK_CLEAR)
#define bfin_write_PINT2_MASK_CLEAR(val) bfin_write32(PINT2_MASK_CLEAR, val)
#define bfin_read_PINT2_REQUEST() bfin_read32(PINT2_REQUEST)
#define bfin_write_PINT2_REQUEST(val) bfin_write32(PINT2_REQUEST, val)
#define bfin_read_PINT2_ASSIGN() bfin_read32(PINT2_ASSIGN)
#define bfin_write_PINT2_ASSIGN(val) bfin_write32(PINT2_ASSIGN, val)
#define bfin_read_PINT2_EDGE_SET() bfin_read32(PINT2_EDGE_SET)
#define bfin_write_PINT2_EDGE_SET(val) bfin_write32(PINT2_EDGE_SET, val)
#define bfin_read_PINT2_EDGE_CLEAR() bfin_read32(PINT2_EDGE_CLEAR)
#define bfin_write_PINT2_EDGE_CLEAR(val) bfin_write32(PINT2_EDGE_CLEAR, val)
#define bfin_read_PINT2_INVERT_SET() bfin_read32(PINT2_INVERT_SET)
#define bfin_write_PINT2_INVERT_SET(val) bfin_write32(PINT2_INVERT_SET, val)
#define bfin_read_PINT2_INVERT_CLEAR() bfin_read32(PINT2_INVERT_CLEAR)
#define bfin_write_PINT2_INVERT_CLEAR(val) bfin_write32(PINT2_INVERT_CLEAR, val)
#define bfin_read_PINT2_PINSTATE() bfin_read32(PINT2_PINSTATE)
#define bfin_write_PINT2_PINSTATE(val) bfin_write32(PINT2_PINSTATE, val)
#define bfin_read_PINT2_LATCH() bfin_read32(PINT2_LATCH)
#define bfin_write_PINT2_LATCH(val) bfin_write32(PINT2_LATCH, val)
/* Port Interrubfin_read_()t 3 Registers (32-bit) */
#define bfin_read_PINT3_MASK_SET() bfin_read32(PINT3_MASK_SET)
#define bfin_write_PINT3_MASK_SET(val) bfin_write32(PINT3_MASK_SET, val)
#define bfin_read_PINT3_MASK_CLEAR() bfin_read32(PINT3_MASK_CLEAR)
#define bfin_write_PINT3_MASK_CLEAR(val) bfin_write32(PINT3_MASK_CLEAR, val)
#define bfin_read_PINT3_REQUEST() bfin_read32(PINT3_REQUEST)
#define bfin_write_PINT3_REQUEST(val) bfin_write32(PINT3_REQUEST, val)
#define bfin_read_PINT3_ASSIGN() bfin_read32(PINT3_ASSIGN)
#define bfin_write_PINT3_ASSIGN(val) bfin_write32(PINT3_ASSIGN, val)
#define bfin_read_PINT3_EDGE_SET() bfin_read32(PINT3_EDGE_SET)
#define bfin_write_PINT3_EDGE_SET(val) bfin_write32(PINT3_EDGE_SET, val)
#define bfin_read_PINT3_EDGE_CLEAR() bfin_read32(PINT3_EDGE_CLEAR)
#define bfin_write_PINT3_EDGE_CLEAR(val) bfin_write32(PINT3_EDGE_CLEAR, val)
#define bfin_read_PINT3_INVERT_SET() bfin_read32(PINT3_INVERT_SET)
#define bfin_write_PINT3_INVERT_SET(val) bfin_write32(PINT3_INVERT_SET, val)
#define bfin_read_PINT3_INVERT_CLEAR() bfin_read32(PINT3_INVERT_CLEAR)
#define bfin_write_PINT3_INVERT_CLEAR(val) bfin_write32(PINT3_INVERT_CLEAR, val)
#define bfin_read_PINT3_PINSTATE() bfin_read32(PINT3_PINSTATE)
#define bfin_write_PINT3_PINSTATE(val) bfin_write32(PINT3_PINSTATE, val)
#define bfin_read_PINT3_LATCH() bfin_read32(PINT3_LATCH)
#define bfin_write_PINT3_LATCH(val) bfin_write32(PINT3_LATCH, val)
/* Port A Registers */
#define bfin_read_PORTA_FER() bfin_read16(PORTA_FER)
#define bfin_write_PORTA_FER(val) bfin_write16(PORTA_FER, val)
#define bfin_read_PORTA() bfin_read16(PORTA)
#define bfin_write_PORTA(val) bfin_write16(PORTA, val)
#define bfin_read_PORTA_SET() bfin_read16(PORTA_SET)
#define bfin_write_PORTA_SET(val) bfin_write16(PORTA_SET, val)
#define bfin_read_PORTA_CLEAR() bfin_read16(PORTA_CLEAR)
#define bfin_write_PORTA_CLEAR(val) bfin_write16(PORTA_CLEAR, val)
#define bfin_read_PORTA_DIR_SET() bfin_read16(PORTA_DIR_SET)
#define bfin_write_PORTA_DIR_SET(val) bfin_write16(PORTA_DIR_SET, val)
#define bfin_read_PORTA_DIR_CLEAR() bfin_read16(PORTA_DIR_CLEAR)
#define bfin_write_PORTA_DIR_CLEAR(val) bfin_write16(PORTA_DIR_CLEAR, val)
#define bfin_read_PORTA_INEN() bfin_read16(PORTA_INEN)
#define bfin_write_PORTA_INEN(val) bfin_write16(PORTA_INEN, val)
#define bfin_read_PORTA_MUX() bfin_read32(PORTA_MUX)
#define bfin_write_PORTA_MUX(val) bfin_write32(PORTA_MUX, val)
/* Port B Registers */
#define bfin_read_PORTB_FER() bfin_read16(PORTB_FER)
#define bfin_write_PORTB_FER(val) bfin_write16(PORTB_FER, val)
#define bfin_read_PORTB() bfin_read16(PORTB)
#define bfin_write_PORTB(val) bfin_write16(PORTB, val)
#define bfin_read_PORTB_SET() bfin_read16(PORTB_SET)
#define bfin_write_PORTB_SET(val) bfin_write16(PORTB_SET, val)
#define bfin_read_PORTB_CLEAR() bfin_read16(PORTB_CLEAR)
#define bfin_write_PORTB_CLEAR(val) bfin_write16(PORTB_CLEAR, val)
#define bfin_read_PORTB_DIR_SET() bfin_read16(PORTB_DIR_SET)
#define bfin_write_PORTB_DIR_SET(val) bfin_write16(PORTB_DIR_SET, val)
#define bfin_read_PORTB_DIR_CLEAR() bfin_read16(PORTB_DIR_CLEAR)
#define bfin_write_PORTB_DIR_CLEAR(val) bfin_write16(PORTB_DIR_CLEAR, val)
#define bfin_read_PORTB_INEN() bfin_read16(PORTB_INEN)
#define bfin_write_PORTB_INEN(val) bfin_write16(PORTB_INEN, val)
#define bfin_read_PORTB_MUX() bfin_read32(PORTB_MUX)
#define bfin_write_PORTB_MUX(val) bfin_write32(PORTB_MUX, val)
/* Port C Registers */
#define bfin_read_PORTC_FER() bfin_read16(PORTC_FER)
#define bfin_write_PORTC_FER(val) bfin_write16(PORTC_FER, val)
#define bfin_read_PORTC() bfin_read16(PORTC)
#define bfin_write_PORTC(val) bfin_write16(PORTC, val)
#define bfin_read_PORTC_SET() bfin_read16(PORTC_SET)
#define bfin_write_PORTC_SET(val) bfin_write16(PORTC_SET, val)
#define bfin_read_PORTC_CLEAR() bfin_read16(PORTC_CLEAR)
#define bfin_write_PORTC_CLEAR(val) bfin_write16(PORTC_CLEAR, val)
#define bfin_read_PORTC_DIR_SET() bfin_read16(PORTC_DIR_SET)
#define bfin_write_PORTC_DIR_SET(val) bfin_write16(PORTC_DIR_SET, val)
#define bfin_read_PORTC_DIR_CLEAR() bfin_read16(PORTC_DIR_CLEAR)
#define bfin_write_PORTC_DIR_CLEAR(val) bfin_write16(PORTC_DIR_CLEAR, val)
#define bfin_read_PORTC_INEN() bfin_read16(PORTC_INEN)
#define bfin_write_PORTC_INEN(val) bfin_write16(PORTC_INEN, val)
#define bfin_read_PORTC_MUX() bfin_read32(PORTC_MUX)
#define bfin_write_PORTC_MUX(val) bfin_write32(PORTC_MUX, val)
/* Port D Registers */
#define bfin_read_PORTD_FER() bfin_read16(PORTD_FER)
#define bfin_write_PORTD_FER(val) bfin_write16(PORTD_FER, val)
#define bfin_read_PORTD() bfin_read16(PORTD)
#define bfin_write_PORTD(val) bfin_write16(PORTD, val)
#define bfin_read_PORTD_SET() bfin_read16(PORTD_SET)
#define bfin_write_PORTD_SET(val) bfin_write16(PORTD_SET, val)
#define bfin_read_PORTD_CLEAR() bfin_read16(PORTD_CLEAR)
#define bfin_write_PORTD_CLEAR(val) bfin_write16(PORTD_CLEAR, val)
#define bfin_read_PORTD_DIR_SET() bfin_read16(PORTD_DIR_SET)
#define bfin_write_PORTD_DIR_SET(val) bfin_write16(PORTD_DIR_SET, val)
#define bfin_read_PORTD_DIR_CLEAR() bfin_read16(PORTD_DIR_CLEAR)
#define bfin_write_PORTD_DIR_CLEAR(val) bfin_write16(PORTD_DIR_CLEAR, val)
#define bfin_read_PORTD_INEN() bfin_read16(PORTD_INEN)
#define bfin_write_PORTD_INEN(val) bfin_write16(PORTD_INEN, val)
#define bfin_read_PORTD_MUX() bfin_read32(PORTD_MUX)
#define bfin_write_PORTD_MUX(val) bfin_write32(PORTD_MUX, val)
/* Port E Registers */
#define bfin_read_PORTE_FER() bfin_read16(PORTE_FER)
#define bfin_write_PORTE_FER(val) bfin_write16(PORTE_FER, val)
#define bfin_read_PORTE() bfin_read16(PORTE)
#define bfin_write_PORTE(val) bfin_write16(PORTE, val)
#define bfin_read_PORTE_SET() bfin_read16(PORTE_SET)
#define bfin_write_PORTE_SET(val) bfin_write16(PORTE_SET, val)
#define bfin_read_PORTE_CLEAR() bfin_read16(PORTE_CLEAR)
#define bfin_write_PORTE_CLEAR(val) bfin_write16(PORTE_CLEAR, val)
#define bfin_read_PORTE_DIR_SET() bfin_read16(PORTE_DIR_SET)
#define bfin_write_PORTE_DIR_SET(val) bfin_write16(PORTE_DIR_SET, val)
#define bfin_read_PORTE_DIR_CLEAR() bfin_read16(PORTE_DIR_CLEAR)
#define bfin_write_PORTE_DIR_CLEAR(val) bfin_write16(PORTE_DIR_CLEAR, val)
#define bfin_read_PORTE_INEN() bfin_read16(PORTE_INEN)
#define bfin_write_PORTE_INEN(val) bfin_write16(PORTE_INEN, val)
#define bfin_read_PORTE_MUX() bfin_read32(PORTE_MUX)
#define bfin_write_PORTE_MUX(val) bfin_write32(PORTE_MUX, val)
/* Port F Registers */
#define bfin_read_PORTF_FER() bfin_read16(PORTF_FER)
#define bfin_write_PORTF_FER(val) bfin_write16(PORTF_FER, val)
#define bfin_read_PORTF() bfin_read16(PORTF)
#define bfin_write_PORTF(val) bfin_write16(PORTF, val)
#define bfin_read_PORTF_SET() bfin_read16(PORTF_SET)
#define bfin_write_PORTF_SET(val) bfin_write16(PORTF_SET, val)
#define bfin_read_PORTF_CLEAR() bfin_read16(PORTF_CLEAR)
#define bfin_write_PORTF_CLEAR(val) bfin_write16(PORTF_CLEAR, val)
#define bfin_read_PORTF_DIR_SET() bfin_read16(PORTF_DIR_SET)
#define bfin_write_PORTF_DIR_SET(val) bfin_write16(PORTF_DIR_SET, val)
#define bfin_read_PORTF_DIR_CLEAR() bfin_read16(PORTF_DIR_CLEAR)
#define bfin_write_PORTF_DIR_CLEAR(val) bfin_write16(PORTF_DIR_CLEAR, val)
#define bfin_read_PORTF_INEN() bfin_read16(PORTF_INEN)
#define bfin_write_PORTF_INEN(val) bfin_write16(PORTF_INEN, val)
#define bfin_read_PORTF_MUX() bfin_read32(PORTF_MUX)
#define bfin_write_PORTF_MUX(val) bfin_write32(PORTF_MUX, val)
/* Port G Registers */
#define bfin_read_PORTG_FER() bfin_read16(PORTG_FER)
#define bfin_write_PORTG_FER(val) bfin_write16(PORTG_FER, val)
#define bfin_read_PORTG() bfin_read16(PORTG)
#define bfin_write_PORTG(val) bfin_write16(PORTG, val)
#define bfin_read_PORTG_SET() bfin_read16(PORTG_SET)
#define bfin_write_PORTG_SET(val) bfin_write16(PORTG_SET, val)
#define bfin_read_PORTG_CLEAR() bfin_read16(PORTG_CLEAR)
#define bfin_write_PORTG_CLEAR(val) bfin_write16(PORTG_CLEAR, val)
#define bfin_read_PORTG_DIR_SET() bfin_read16(PORTG_DIR_SET)
#define bfin_write_PORTG_DIR_SET(val) bfin_write16(PORTG_DIR_SET, val)
#define bfin_read_PORTG_DIR_CLEAR() bfin_read16(PORTG_DIR_CLEAR)
#define bfin_write_PORTG_DIR_CLEAR(val) bfin_write16(PORTG_DIR_CLEAR, val)
#define bfin_read_PORTG_INEN() bfin_read16(PORTG_INEN)
#define bfin_write_PORTG_INEN(val) bfin_write16(PORTG_INEN, val)
#define bfin_read_PORTG_MUX() bfin_read32(PORTG_MUX)
#define bfin_write_PORTG_MUX(val) bfin_write32(PORTG_MUX, val)
/* Port H Registers */
#define bfin_read_PORTH_FER() bfin_read16(PORTH_FER)
#define bfin_write_PORTH_FER(val) bfin_write16(PORTH_FER, val)
#define bfin_read_PORTH() bfin_read16(PORTH)
#define bfin_write_PORTH(val) bfin_write16(PORTH, val)
#define bfin_read_PORTH_SET() bfin_read16(PORTH_SET)
#define bfin_write_PORTH_SET(val) bfin_write16(PORTH_SET, val)
#define bfin_read_PORTH_CLEAR() bfin_read16(PORTH_CLEAR)
#define bfin_write_PORTH_CLEAR(val) bfin_write16(PORTH_CLEAR, val)
#define bfin_read_PORTH_DIR_SET() bfin_read16(PORTH_DIR_SET)
#define bfin_write_PORTH_DIR_SET(val) bfin_write16(PORTH_DIR_SET, val)
#define bfin_read_PORTH_DIR_CLEAR() bfin_read16(PORTH_DIR_CLEAR)
#define bfin_write_PORTH_DIR_CLEAR(val) bfin_write16(PORTH_DIR_CLEAR, val)
#define bfin_read_PORTH_INEN() bfin_read16(PORTH_INEN)
#define bfin_write_PORTH_INEN(val) bfin_write16(PORTH_INEN, val)
#define bfin_read_PORTH_MUX() bfin_read32(PORTH_MUX)
#define bfin_write_PORTH_MUX(val) bfin_write32(PORTH_MUX, val)
/* Port I Registers */
#define bfin_read_PORTI_FER() bfin_read16(PORTI_FER)
#define bfin_write_PORTI_FER(val) bfin_write16(PORTI_FER, val)
#define bfin_read_PORTI() bfin_read16(PORTI)
#define bfin_write_PORTI(val) bfin_write16(PORTI, val)
#define bfin_read_PORTI_SET() bfin_read16(PORTI_SET)
#define bfin_write_PORTI_SET(val) bfin_write16(PORTI_SET, val)
#define bfin_read_PORTI_CLEAR() bfin_read16(PORTI_CLEAR)
#define bfin_write_PORTI_CLEAR(val) bfin_write16(PORTI_CLEAR, val)
#define bfin_read_PORTI_DIR_SET() bfin_read16(PORTI_DIR_SET)
#define bfin_write_PORTI_DIR_SET(val) bfin_write16(PORTI_DIR_SET, val)
#define bfin_read_PORTI_DIR_CLEAR() bfin_read16(PORTI_DIR_CLEAR)
#define bfin_write_PORTI_DIR_CLEAR(val) bfin_write16(PORTI_DIR_CLEAR, val)
#define bfin_read_PORTI_INEN() bfin_read16(PORTI_INEN)
#define bfin_write_PORTI_INEN(val) bfin_write16(PORTI_INEN, val)
#define bfin_read_PORTI_MUX() bfin_read32(PORTI_MUX)
#define bfin_write_PORTI_MUX(val) bfin_write32(PORTI_MUX, val)
/* Port J Registers */
#define bfin_read_PORTJ_FER() bfin_read16(PORTJ_FER)
#define bfin_write_PORTJ_FER(val) bfin_write16(PORTJ_FER, val)
#define bfin_read_PORTJ() bfin_read16(PORTJ)
#define bfin_write_PORTJ(val) bfin_write16(PORTJ, val)
#define bfin_read_PORTJ_SET() bfin_read16(PORTJ_SET)
#define bfin_write_PORTJ_SET(val) bfin_write16(PORTJ_SET, val)
#define bfin_read_PORTJ_CLEAR() bfin_read16(PORTJ_CLEAR)
#define bfin_write_PORTJ_CLEAR(val) bfin_write16(PORTJ_CLEAR, val)
#define bfin_read_PORTJ_DIR_SET() bfin_read16(PORTJ_DIR_SET)
#define bfin_write_PORTJ_DIR_SET(val) bfin_write16(PORTJ_DIR_SET, val)
#define bfin_read_PORTJ_DIR_CLEAR() bfin_read16(PORTJ_DIR_CLEAR)
#define bfin_write_PORTJ_DIR_CLEAR(val) bfin_write16(PORTJ_DIR_CLEAR, val)
#define bfin_read_PORTJ_INEN() bfin_read16(PORTJ_INEN)
#define bfin_write_PORTJ_INEN(val) bfin_write16(PORTJ_INEN, val)
#define bfin_read_PORTJ_MUX() bfin_read32(PORTJ_MUX)
#define bfin_write_PORTJ_MUX(val) bfin_write32(PORTJ_MUX, val)
/* PWM Timer Registers */
#define bfin_read_TIMER0_CONFIG() bfin_read16(TIMER0_CONFIG)
#define bfin_write_TIMER0_CONFIG(val) bfin_write16(TIMER0_CONFIG, val)
#define bfin_read_TIMER0_COUNTER() bfin_read32(TIMER0_COUNTER)
#define bfin_write_TIMER0_COUNTER(val) bfin_write32(TIMER0_COUNTER, val)
#define bfin_read_TIMER0_PERIOD() bfin_read32(TIMER0_PERIOD)
#define bfin_write_TIMER0_PERIOD(val) bfin_write32(TIMER0_PERIOD, val)
#define bfin_read_TIMER0_WIDTH() bfin_read32(TIMER0_WIDTH)
#define bfin_write_TIMER0_WIDTH(val) bfin_write32(TIMER0_WIDTH, val)
#define bfin_read_TIMER1_CONFIG() bfin_read16(TIMER1_CONFIG)
#define bfin_write_TIMER1_CONFIG(val) bfin_write16(TIMER1_CONFIG, val)
#define bfin_read_TIMER1_COUNTER() bfin_read32(TIMER1_COUNTER)
#define bfin_write_TIMER1_COUNTER(val) bfin_write32(TIMER1_COUNTER, val)
#define bfin_read_TIMER1_PERIOD() bfin_read32(TIMER1_PERIOD)
#define bfin_write_TIMER1_PERIOD(val) bfin_write32(TIMER1_PERIOD, val)
#define bfin_read_TIMER1_WIDTH() bfin_read32(TIMER1_WIDTH)
#define bfin_write_TIMER1_WIDTH(val) bfin_write32(TIMER1_WIDTH, val)
#define bfin_read_TIMER2_CONFIG() bfin_read16(TIMER2_CONFIG)
#define bfin_write_TIMER2_CONFIG(val) bfin_write16(TIMER2_CONFIG, val)
#define bfin_read_TIMER2_COUNTER() bfin_read32(TIMER2_COUNTER)
#define bfin_write_TIMER2_COUNTER(val) bfin_write32(TIMER2_COUNTER, val)
#define bfin_read_TIMER2_PERIOD() bfin_read32(TIMER2_PERIOD)
#define bfin_write_TIMER2_PERIOD(val) bfin_write32(TIMER2_PERIOD, val)
#define bfin_read_TIMER2_WIDTH() bfin_read32(TIMER2_WIDTH)
#define bfin_write_TIMER2_WIDTH(val) bfin_write32(TIMER2_WIDTH, val)
#define bfin_read_TIMER3_CONFIG() bfin_read16(TIMER3_CONFIG)
#define bfin_write_TIMER3_CONFIG(val) bfin_write16(TIMER3_CONFIG, val)
#define bfin_read_TIMER3_COUNTER() bfin_read32(TIMER3_COUNTER)
#define bfin_write_TIMER3_COUNTER(val) bfin_write32(TIMER3_COUNTER, val)
#define bfin_read_TIMER3_PERIOD() bfin_read32(TIMER3_PERIOD)
#define bfin_write_TIMER3_PERIOD(val) bfin_write32(TIMER3_PERIOD, val)
#define bfin_read_TIMER3_WIDTH() bfin_read32(TIMER3_WIDTH)
#define bfin_write_TIMER3_WIDTH(val) bfin_write32(TIMER3_WIDTH, val)
#define bfin_read_TIMER4_CONFIG() bfin_read16(TIMER4_CONFIG)
#define bfin_write_TIMER4_CONFIG(val) bfin_write16(TIMER4_CONFIG, val)
#define bfin_read_TIMER4_COUNTER() bfin_read32(TIMER4_COUNTER)
#define bfin_write_TIMER4_COUNTER(val) bfin_write32(TIMER4_COUNTER, val)
#define bfin_read_TIMER4_PERIOD() bfin_read32(TIMER4_PERIOD)
#define bfin_write_TIMER4_PERIOD(val) bfin_write32(TIMER4_PERIOD, val)
#define bfin_read_TIMER4_WIDTH() bfin_read32(TIMER4_WIDTH)
#define bfin_write_TIMER4_WIDTH(val) bfin_write32(TIMER4_WIDTH, val)
#define bfin_read_TIMER5_CONFIG() bfin_read16(TIMER5_CONFIG)
#define bfin_write_TIMER5_CONFIG(val) bfin_write16(TIMER5_CONFIG, val)
#define bfin_read_TIMER5_COUNTER() bfin_read32(TIMER5_COUNTER)
#define bfin_write_TIMER5_COUNTER(val) bfin_write32(TIMER5_COUNTER, val)
#define bfin_read_TIMER5_PERIOD() bfin_read32(TIMER5_PERIOD)
#define bfin_write_TIMER5_PERIOD(val) bfin_write32(TIMER5_PERIOD, val)
#define bfin_read_TIMER5_WIDTH() bfin_read32(TIMER5_WIDTH)
#define bfin_write_TIMER5_WIDTH(val) bfin_write32(TIMER5_WIDTH, val)
#define bfin_read_TIMER6_CONFIG() bfin_read16(TIMER6_CONFIG)
#define bfin_write_TIMER6_CONFIG(val) bfin_write16(TIMER6_CONFIG, val)
#define bfin_read_TIMER6_COUNTER() bfin_read32(TIMER6_COUNTER)
#define bfin_write_TIMER6_COUNTER(val) bfin_write32(TIMER6_COUNTER, val)
#define bfin_read_TIMER6_PERIOD() bfin_read32(TIMER6_PERIOD)
#define bfin_write_TIMER6_PERIOD(val) bfin_write32(TIMER6_PERIOD, val)
#define bfin_read_TIMER6_WIDTH() bfin_read32(TIMER6_WIDTH)
#define bfin_write_TIMER6_WIDTH(val) bfin_write32(TIMER6_WIDTH, val)
#define bfin_read_TIMER7_CONFIG() bfin_read16(TIMER7_CONFIG)
#define bfin_write_TIMER7_CONFIG(val) bfin_write16(TIMER7_CONFIG, val)
#define bfin_read_TIMER7_COUNTER() bfin_read32(TIMER7_COUNTER)
#define bfin_write_TIMER7_COUNTER(val) bfin_write32(TIMER7_COUNTER, val)
#define bfin_read_TIMER7_PERIOD() bfin_read32(TIMER7_PERIOD)
#define bfin_write_TIMER7_PERIOD(val) bfin_write32(TIMER7_PERIOD, val)
#define bfin_read_TIMER7_WIDTH() bfin_read32(TIMER7_WIDTH)
#define bfin_write_TIMER7_WIDTH(val) bfin_write32(TIMER7_WIDTH, val)
/* Timer Groubfin_read_() of 8 */
#define bfin_read_TIMER_ENABLE0() bfin_read16(TIMER_ENABLE0)
#define bfin_write_TIMER_ENABLE0(val) bfin_write16(TIMER_ENABLE0, val)
#define bfin_read_TIMER_DISABLE0() bfin_read16(TIMER_DISABLE0)
#define bfin_write_TIMER_DISABLE0(val) bfin_write16(TIMER_DISABLE0, val)
#define bfin_read_TIMER_STATUS0() bfin_read32(TIMER_STATUS0)
#define bfin_write_TIMER_STATUS0(val) bfin_write32(TIMER_STATUS0, val)
/* DMAC1 Registers */
#define bfin_read_DMAC1_TC_PER() bfin_read16(DMAC1_TC_PER)
#define bfin_write_DMAC1_TC_PER(val) bfin_write16(DMAC1_TC_PER, val)
#define bfin_read_DMAC1_TC_CNT() bfin_read16(DMAC1_TC_CNT)
#define bfin_write_DMAC1_TC_CNT(val) bfin_write16(DMAC1_TC_CNT, val)
/* DMA Channel 12 Registers */
#define bfin_read_DMA12_NEXT_DESC_PTR() bfin_read32(DMA12_NEXT_DESC_PTR)
#define bfin_write_DMA12_NEXT_DESC_PTR(val) bfin_write32(DMA12_NEXT_DESC_PTR, val)
#define bfin_read_DMA12_START_ADDR() bfin_read32(DMA12_START_ADDR)
#define bfin_write_DMA12_START_ADDR(val) bfin_write32(DMA12_START_ADDR, val)
#define bfin_read_DMA12_CONFIG() bfin_read16(DMA12_CONFIG)
#define bfin_write_DMA12_CONFIG(val) bfin_write16(DMA12_CONFIG, val)
#define bfin_read_DMA12_X_COUNT() bfin_read16(DMA12_X_COUNT)
#define bfin_write_DMA12_X_COUNT(val) bfin_write16(DMA12_X_COUNT, val)
#define bfin_read_DMA12_X_MODIFY() bfin_read16(DMA12_X_MODIFY)
#define bfin_write_DMA12_X_MODIFY(val) bfin_write16(DMA12_X_MODIFY, val)
#define bfin_read_DMA12_Y_COUNT() bfin_read16(DMA12_Y_COUNT)
#define bfin_write_DMA12_Y_COUNT(val) bfin_write16(DMA12_Y_COUNT, val)
#define bfin_read_DMA12_Y_MODIFY() bfin_read16(DMA12_Y_MODIFY)
#define bfin_write_DMA12_Y_MODIFY(val) bfin_write16(DMA12_Y_MODIFY, val)
#define bfin_read_DMA12_CURR_DESC_PTR() bfin_read32(DMA12_CURR_DESC_PTR)
#define bfin_write_DMA12_CURR_DESC_PTR(val) bfin_write32(DMA12_CURR_DESC_PTR, val)
#define bfin_read_DMA12_CURR_ADDR() bfin_read32(DMA12_CURR_ADDR)
#define bfin_write_DMA12_CURR_ADDR(val) bfin_write32(DMA12_CURR_ADDR, val)
#define bfin_read_DMA12_IRQ_STATUS() bfin_read16(DMA12_IRQ_STATUS)
#define bfin_write_DMA12_IRQ_STATUS(val) bfin_write16(DMA12_IRQ_STATUS, val)
#define bfin_read_DMA12_PERIPHERAL_MAP() bfin_read16(DMA12_PERIPHERAL_MAP)
#define bfin_write_DMA12_PERIPHERAL_MAP(val) bfin_write16(DMA12_PERIPHERAL_MAP, val)
#define bfin_read_DMA12_CURR_X_COUNT() bfin_read16(DMA12_CURR_X_COUNT)
#define bfin_write_DMA12_CURR_X_COUNT(val) bfin_write16(DMA12_CURR_X_COUNT, val)
#define bfin_read_DMA12_CURR_Y_COUNT() bfin_read16(DMA12_CURR_Y_COUNT)
#define bfin_write_DMA12_CURR_Y_COUNT(val) bfin_write16(DMA12_CURR_Y_COUNT, val)
/* DMA Channel 13 Registers */
#define bfin_read_DMA13_NEXT_DESC_PTR() bfin_read32(DMA13_NEXT_DESC_PTR)
#define bfin_write_DMA13_NEXT_DESC_PTR(val) bfin_write32(DMA13_NEXT_DESC_PTR, val)
#define bfin_read_DMA13_START_ADDR() bfin_read32(DMA13_START_ADDR)
#define bfin_write_DMA13_START_ADDR(val) bfin_write32(DMA13_START_ADDR, val)
#define bfin_read_DMA13_CONFIG() bfin_read16(DMA13_CONFIG)
#define bfin_write_DMA13_CONFIG(val) bfin_write16(DMA13_CONFIG, val)
#define bfin_read_DMA13_X_COUNT() bfin_read16(DMA13_X_COUNT)
#define bfin_write_DMA13_X_COUNT(val) bfin_write16(DMA13_X_COUNT, val)
#define bfin_read_DMA13_X_MODIFY() bfin_read16(DMA13_X_MODIFY)
#define bfin_write_DMA13_X_MODIFY(val) bfin_write16(DMA13_X_MODIFY, val)
#define bfin_read_DMA13_Y_COUNT() bfin_read16(DMA13_Y_COUNT)
#define bfin_write_DMA13_Y_COUNT(val) bfin_write16(DMA13_Y_COUNT, val)
#define bfin_read_DMA13_Y_MODIFY() bfin_read16(DMA13_Y_MODIFY)
#define bfin_write_DMA13_Y_MODIFY(val) bfin_write16(DMA13_Y_MODIFY, val)
#define bfin_read_DMA13_CURR_DESC_PTR() bfin_read32(DMA13_CURR_DESC_PTR)
#define bfin_write_DMA13_CURR_DESC_PTR(val) bfin_write32(DMA13_CURR_DESC_PTR, val)
#define bfin_read_DMA13_CURR_ADDR() bfin_read32(DMA13_CURR_ADDR)
#define bfin_write_DMA13_CURR_ADDR(val) bfin_write32(DMA13_CURR_ADDR, val)
#define bfin_read_DMA13_IRQ_STATUS() bfin_read16(DMA13_IRQ_STATUS)
#define bfin_write_DMA13_IRQ_STATUS(val) bfin_write16(DMA13_IRQ_STATUS, val)
#define bfin_read_DMA13_PERIPHERAL_MAP() bfin_read16(DMA13_PERIPHERAL_MAP)
#define bfin_write_DMA13_PERIPHERAL_MAP(val) bfin_write16(DMA13_PERIPHERAL_MAP, val)
#define bfin_read_DMA13_CURR_X_COUNT() bfin_read16(DMA13_CURR_X_COUNT)
#define bfin_write_DMA13_CURR_X_COUNT(val) bfin_write16(DMA13_CURR_X_COUNT, val)
#define bfin_read_DMA13_CURR_Y_COUNT() bfin_read16(DMA13_CURR_Y_COUNT)
#define bfin_write_DMA13_CURR_Y_COUNT(val) bfin_write16(DMA13_CURR_Y_COUNT, val)
/* DMA Channel 14 Registers */
#define bfin_read_DMA14_NEXT_DESC_PTR() bfin_read32(DMA14_NEXT_DESC_PTR)
#define bfin_write_DMA14_NEXT_DESC_PTR(val) bfin_write32(DMA14_NEXT_DESC_PTR, val)
#define bfin_read_DMA14_START_ADDR() bfin_read32(DMA14_START_ADDR)
#define bfin_write_DMA14_START_ADDR(val) bfin_write32(DMA14_START_ADDR, val)
#define bfin_read_DMA14_CONFIG() bfin_read16(DMA14_CONFIG)
#define bfin_write_DMA14_CONFIG(val) bfin_write16(DMA14_CONFIG, val)
#define bfin_read_DMA14_X_COUNT() bfin_read16(DMA14_X_COUNT)
#define bfin_write_DMA14_X_COUNT(val) bfin_write16(DMA14_X_COUNT, val)
#define bfin_read_DMA14_X_MODIFY() bfin_read16(DMA14_X_MODIFY)
#define bfin_write_DMA14_X_MODIFY(val) bfin_write16(DMA14_X_MODIFY, val)
#define bfin_read_DMA14_Y_COUNT() bfin_read16(DMA14_Y_COUNT)
#define bfin_write_DMA14_Y_COUNT(val) bfin_write16(DMA14_Y_COUNT, val)
#define bfin_read_DMA14_Y_MODIFY() bfin_read16(DMA14_Y_MODIFY)
#define bfin_write_DMA14_Y_MODIFY(val) bfin_write16(DMA14_Y_MODIFY, val)
#define bfin_read_DMA14_CURR_DESC_PTR() bfin_read32(DMA14_CURR_DESC_PTR)
#define bfin_write_DMA14_CURR_DESC_PTR(val) bfin_write32(DMA14_CURR_DESC_PTR, val)
#define bfin_read_DMA14_CURR_ADDR() bfin_read32(DMA14_CURR_ADDR)
#define bfin_write_DMA14_CURR_ADDR(val) bfin_write32(DMA14_CURR_ADDR, val)
#define bfin_read_DMA14_IRQ_STATUS() bfin_read16(DMA14_IRQ_STATUS)
#define bfin_write_DMA14_IRQ_STATUS(val) bfin_write16(DMA14_IRQ_STATUS, val)
#define bfin_read_DMA14_PERIPHERAL_MAP() bfin_read16(DMA14_PERIPHERAL_MAP)
#define bfin_write_DMA14_PERIPHERAL_MAP(val) bfin_write16(DMA14_PERIPHERAL_MAP, val)
#define bfin_read_DMA14_CURR_X_COUNT() bfin_read16(DMA14_CURR_X_COUNT)
#define bfin_write_DMA14_CURR_X_COUNT(val) bfin_write16(DMA14_CURR_X_COUNT, val)
#define bfin_read_DMA14_CURR_Y_COUNT() bfin_read16(DMA14_CURR_Y_COUNT)
#define bfin_write_DMA14_CURR_Y_COUNT(val) bfin_write16(DMA14_CURR_Y_COUNT, val)
/* DMA Channel 15 Registers */
#define bfin_read_DMA15_NEXT_DESC_PTR() bfin_read32(DMA15_NEXT_DESC_PTR)
#define bfin_write_DMA15_NEXT_DESC_PTR(val) bfin_write32(DMA15_NEXT_DESC_PTR, val)
#define bfin_read_DMA15_START_ADDR() bfin_read32(DMA15_START_ADDR)
#define bfin_write_DMA15_START_ADDR(val) bfin_write32(DMA15_START_ADDR, val)
#define bfin_read_DMA15_CONFIG() bfin_read16(DMA15_CONFIG)
#define bfin_write_DMA15_CONFIG(val) bfin_write16(DMA15_CONFIG, val)
#define bfin_read_DMA15_X_COUNT() bfin_read16(DMA15_X_COUNT)
#define bfin_write_DMA15_X_COUNT(val) bfin_write16(DMA15_X_COUNT, val)
#define bfin_read_DMA15_X_MODIFY() bfin_read16(DMA15_X_MODIFY)
#define bfin_write_DMA15_X_MODIFY(val) bfin_write16(DMA15_X_MODIFY, val)
#define bfin_read_DMA15_Y_COUNT() bfin_read16(DMA15_Y_COUNT)
#define bfin_write_DMA15_Y_COUNT(val) bfin_write16(DMA15_Y_COUNT, val)
#define bfin_read_DMA15_Y_MODIFY() bfin_read16(DMA15_Y_MODIFY)
#define bfin_write_DMA15_Y_MODIFY(val) bfin_write16(DMA15_Y_MODIFY, val)
#define bfin_read_DMA15_CURR_DESC_PTR() bfin_read32(DMA15_CURR_DESC_PTR)
#define bfin_write_DMA15_CURR_DESC_PTR(val) bfin_write32(DMA15_CURR_DESC_PTR, val)
#define bfin_read_DMA15_CURR_ADDR() bfin_read32(DMA15_CURR_ADDR)
#define bfin_write_DMA15_CURR_ADDR(val) bfin_write32(DMA15_CURR_ADDR, val)
#define bfin_read_DMA15_IRQ_STATUS() bfin_read16(DMA15_IRQ_STATUS)
#define bfin_write_DMA15_IRQ_STATUS(val) bfin_write16(DMA15_IRQ_STATUS, val)
#define bfin_read_DMA15_PERIPHERAL_MAP() bfin_read16(DMA15_PERIPHERAL_MAP)
#define bfin_write_DMA15_PERIPHERAL_MAP(val) bfin_write16(DMA15_PERIPHERAL_MAP, val)
#define bfin_read_DMA15_CURR_X_COUNT() bfin_read16(DMA15_CURR_X_COUNT)
#define bfin_write_DMA15_CURR_X_COUNT(val) bfin_write16(DMA15_CURR_X_COUNT, val)
#define bfin_read_DMA15_CURR_Y_COUNT() bfin_read16(DMA15_CURR_Y_COUNT)
#define bfin_write_DMA15_CURR_Y_COUNT(val) bfin_write16(DMA15_CURR_Y_COUNT, val)
/* DMA Channel 16 Registers */
#define bfin_read_DMA16_NEXT_DESC_PTR() bfin_read32(DMA16_NEXT_DESC_PTR)
#define bfin_write_DMA16_NEXT_DESC_PTR(val) bfin_write32(DMA16_NEXT_DESC_PTR, val)
#define bfin_read_DMA16_START_ADDR() bfin_read32(DMA16_START_ADDR)
#define bfin_write_DMA16_START_ADDR(val) bfin_write32(DMA16_START_ADDR, val)
#define bfin_read_DMA16_CONFIG() bfin_read16(DMA16_CONFIG)
#define bfin_write_DMA16_CONFIG(val) bfin_write16(DMA16_CONFIG, val)
#define bfin_read_DMA16_X_COUNT() bfin_read16(DMA16_X_COUNT)
#define bfin_write_DMA16_X_COUNT(val) bfin_write16(DMA16_X_COUNT, val)
#define bfin_read_DMA16_X_MODIFY() bfin_read16(DMA16_X_MODIFY)
#define bfin_write_DMA16_X_MODIFY(val) bfin_write16(DMA16_X_MODIFY, val)
#define bfin_read_DMA16_Y_COUNT() bfin_read16(DMA16_Y_COUNT)
#define bfin_write_DMA16_Y_COUNT(val) bfin_write16(DMA16_Y_COUNT, val)
#define bfin_read_DMA16_Y_MODIFY() bfin_read16(DMA16_Y_MODIFY)
#define bfin_write_DMA16_Y_MODIFY(val) bfin_write16(DMA16_Y_MODIFY, val)
#define bfin_read_DMA16_CURR_DESC_PTR() bfin_read32(DMA16_CURR_DESC_PTR)
#define bfin_write_DMA16_CURR_DESC_PTR(val) bfin_write32(DMA16_CURR_DESC_PTR, val)
#define bfin_read_DMA16_CURR_ADDR() bfin_read32(DMA16_CURR_ADDR)
#define bfin_write_DMA16_CURR_ADDR(val) bfin_write32(DMA16_CURR_ADDR, val)
#define bfin_read_DMA16_IRQ_STATUS() bfin_read16(DMA16_IRQ_STATUS)
#define bfin_write_DMA16_IRQ_STATUS(val) bfin_write16(DMA16_IRQ_STATUS, val)
#define bfin_read_DMA16_PERIPHERAL_MAP() bfin_read16(DMA16_PERIPHERAL_MAP)
#define bfin_write_DMA16_PERIPHERAL_MAP(val) bfin_write16(DMA16_PERIPHERAL_MAP, val)
#define bfin_read_DMA16_CURR_X_COUNT() bfin_read16(DMA16_CURR_X_COUNT)
#define bfin_write_DMA16_CURR_X_COUNT(val) bfin_write16(DMA16_CURR_X_COUNT, val)
#define bfin_read_DMA16_CURR_Y_COUNT() bfin_read16(DMA16_CURR_Y_COUNT)
#define bfin_write_DMA16_CURR_Y_COUNT(val) bfin_write16(DMA16_CURR_Y_COUNT, val)
/* DMA Channel 17 Registers */
#define bfin_read_DMA17_NEXT_DESC_PTR() bfin_read32(DMA17_NEXT_DESC_PTR)
#define bfin_write_DMA17_NEXT_DESC_PTR(val) bfin_write32(DMA17_NEXT_DESC_PTR, val)
#define bfin_read_DMA17_START_ADDR() bfin_read32(DMA17_START_ADDR)
#define bfin_write_DMA17_START_ADDR(val) bfin_write32(DMA17_START_ADDR, val)
#define bfin_read_DMA17_CONFIG() bfin_read16(DMA17_CONFIG)
#define bfin_write_DMA17_CONFIG(val) bfin_write16(DMA17_CONFIG, val)
#define bfin_read_DMA17_X_COUNT() bfin_read16(DMA17_X_COUNT)
#define bfin_write_DMA17_X_COUNT(val) bfin_write16(DMA17_X_COUNT, val)
#define bfin_read_DMA17_X_MODIFY() bfin_read16(DMA17_X_MODIFY)
#define bfin_write_DMA17_X_MODIFY(val) bfin_write16(DMA17_X_MODIFY, val)
#define bfin_read_DMA17_Y_COUNT() bfin_read16(DMA17_Y_COUNT)
#define bfin_write_DMA17_Y_COUNT(val) bfin_write16(DMA17_Y_COUNT, val)
#define bfin_read_DMA17_Y_MODIFY() bfin_read16(DMA17_Y_MODIFY)
#define bfin_write_DMA17_Y_MODIFY(val) bfin_write16(DMA17_Y_MODIFY, val)
#define bfin_read_DMA17_CURR_DESC_PTR() bfin_read32(DMA17_CURR_DESC_PTR)
#define bfin_write_DMA17_CURR_DESC_PTR(val) bfin_write32(DMA17_CURR_DESC_PTR, val)
#define bfin_read_DMA17_CURR_ADDR() bfin_read32(DMA17_CURR_ADDR)
#define bfin_write_DMA17_CURR_ADDR(val) bfin_write32(DMA17_CURR_ADDR, val)
#define bfin_read_DMA17_IRQ_STATUS() bfin_read16(DMA17_IRQ_STATUS)
#define bfin_write_DMA17_IRQ_STATUS(val) bfin_write16(DMA17_IRQ_STATUS, val)
#define bfin_read_DMA17_PERIPHERAL_MAP() bfin_read16(DMA17_PERIPHERAL_MAP)
#define bfin_write_DMA17_PERIPHERAL_MAP(val) bfin_write16(DMA17_PERIPHERAL_MAP, val)
#define bfin_read_DMA17_CURR_X_COUNT() bfin_read16(DMA17_CURR_X_COUNT)
#define bfin_write_DMA17_CURR_X_COUNT(val) bfin_write16(DMA17_CURR_X_COUNT, val)
#define bfin_read_DMA17_CURR_Y_COUNT() bfin_read16(DMA17_CURR_Y_COUNT)
#define bfin_write_DMA17_CURR_Y_COUNT(val) bfin_write16(DMA17_CURR_Y_COUNT, val)
/* DMA Channel 18 Registers */
#define bfin_read_DMA18_NEXT_DESC_PTR() bfin_read32(DMA18_NEXT_DESC_PTR)
#define bfin_write_DMA18_NEXT_DESC_PTR(val) bfin_write32(DMA18_NEXT_DESC_PTR, val)
#define bfin_read_DMA18_START_ADDR() bfin_read32(DMA18_START_ADDR)
#define bfin_write_DMA18_START_ADDR(val) bfin_write32(DMA18_START_ADDR, val)
#define bfin_read_DMA18_CONFIG() bfin_read16(DMA18_CONFIG)
#define bfin_write_DMA18_CONFIG(val) bfin_write16(DMA18_CONFIG, val)
#define bfin_read_DMA18_X_COUNT() bfin_read16(DMA18_X_COUNT)
#define bfin_write_DMA18_X_COUNT(val) bfin_write16(DMA18_X_COUNT, val)
#define bfin_read_DMA18_X_MODIFY() bfin_read16(DMA18_X_MODIFY)
#define bfin_write_DMA18_X_MODIFY(val) bfin_write16(DMA18_X_MODIFY, val)
#define bfin_read_DMA18_Y_COUNT() bfin_read16(DMA18_Y_COUNT)
#define bfin_write_DMA18_Y_COUNT(val) bfin_write16(DMA18_Y_COUNT, val)
#define bfin_read_DMA18_Y_MODIFY() bfin_read16(DMA18_Y_MODIFY)
#define bfin_write_DMA18_Y_MODIFY(val) bfin_write16(DMA18_Y_MODIFY, val)
#define bfin_read_DMA18_CURR_DESC_PTR() bfin_read32(DMA18_CURR_DESC_PTR)
#define bfin_write_DMA18_CURR_DESC_PTR(val) bfin_write32(DMA18_CURR_DESC_PTR, val)
#define bfin_read_DMA18_CURR_ADDR() bfin_read32(DMA18_CURR_ADDR)
#define bfin_write_DMA18_CURR_ADDR(val) bfin_write32(DMA18_CURR_ADDR, val)
#define bfin_read_DMA18_IRQ_STATUS() bfin_read16(DMA18_IRQ_STATUS)
#define bfin_write_DMA18_IRQ_STATUS(val) bfin_write16(DMA18_IRQ_STATUS, val)
#define bfin_read_DMA18_PERIPHERAL_MAP() bfin_read16(DMA18_PERIPHERAL_MAP)
#define bfin_write_DMA18_PERIPHERAL_MAP(val) bfin_write16(DMA18_PERIPHERAL_MAP, val)
#define bfin_read_DMA18_CURR_X_COUNT() bfin_read16(DMA18_CURR_X_COUNT)
#define bfin_write_DMA18_CURR_X_COUNT(val) bfin_write16(DMA18_CURR_X_COUNT, val)
#define bfin_read_DMA18_CURR_Y_COUNT() bfin_read16(DMA18_CURR_Y_COUNT)
#define bfin_write_DMA18_CURR_Y_COUNT(val) bfin_write16(DMA18_CURR_Y_COUNT, val)
/* DMA Channel 19 Registers */
#define bfin_read_DMA19_NEXT_DESC_PTR() bfin_read32(DMA19_NEXT_DESC_PTR)
#define bfin_write_DMA19_NEXT_DESC_PTR(val) bfin_write32(DMA19_NEXT_DESC_PTR, val)
#define bfin_read_DMA19_START_ADDR() bfin_read32(DMA19_START_ADDR)
#define bfin_write_DMA19_START_ADDR(val) bfin_write32(DMA19_START_ADDR, val)
#define bfin_read_DMA19_CONFIG() bfin_read16(DMA19_CONFIG)
#define bfin_write_DMA19_CONFIG(val) bfin_write16(DMA19_CONFIG, val)
#define bfin_read_DMA19_X_COUNT() bfin_read16(DMA19_X_COUNT)
#define bfin_write_DMA19_X_COUNT(val) bfin_write16(DMA19_X_COUNT, val)
#define bfin_read_DMA19_X_MODIFY() bfin_read16(DMA19_X_MODIFY)
#define bfin_write_DMA19_X_MODIFY(val) bfin_write16(DMA19_X_MODIFY, val)
#define bfin_read_DMA19_Y_COUNT() bfin_read16(DMA19_Y_COUNT)
#define bfin_write_DMA19_Y_COUNT(val) bfin_write16(DMA19_Y_COUNT, val)
#define bfin_read_DMA19_Y_MODIFY() bfin_read16(DMA19_Y_MODIFY)
#define bfin_write_DMA19_Y_MODIFY(val) bfin_write16(DMA19_Y_MODIFY, val)
#define bfin_read_DMA19_CURR_DESC_PTR() bfin_read32(DMA19_CURR_DESC_PTR)
#define bfin_write_DMA19_CURR_DESC_PTR(val) bfin_write32(DMA19_CURR_DESC_PTR, val)
#define bfin_read_DMA19_CURR_ADDR() bfin_read32(DMA19_CURR_ADDR)
#define bfin_write_DMA19_CURR_ADDR(val) bfin_write32(DMA19_CURR_ADDR, val)
#define bfin_read_DMA19_IRQ_STATUS() bfin_read16(DMA19_IRQ_STATUS)
#define bfin_write_DMA19_IRQ_STATUS(val) bfin_write16(DMA19_IRQ_STATUS, val)
#define bfin_read_DMA19_PERIPHERAL_MAP() bfin_read16(DMA19_PERIPHERAL_MAP)
#define bfin_write_DMA19_PERIPHERAL_MAP(val) bfin_write16(DMA19_PERIPHERAL_MAP, val)
#define bfin_read_DMA19_CURR_X_COUNT() bfin_read16(DMA19_CURR_X_COUNT)
#define bfin_write_DMA19_CURR_X_COUNT(val) bfin_write16(DMA19_CURR_X_COUNT, val)
#define bfin_read_DMA19_CURR_Y_COUNT() bfin_read16(DMA19_CURR_Y_COUNT)
#define bfin_write_DMA19_CURR_Y_COUNT(val) bfin_write16(DMA19_CURR_Y_COUNT, val)
/* DMA Channel 20 Registers */
#define bfin_read_DMA20_NEXT_DESC_PTR() bfin_read32(DMA20_NEXT_DESC_PTR)
#define bfin_write_DMA20_NEXT_DESC_PTR(val) bfin_write32(DMA20_NEXT_DESC_PTR, val)
#define bfin_read_DMA20_START_ADDR() bfin_read32(DMA20_START_ADDR)
#define bfin_write_DMA20_START_ADDR(val) bfin_write32(DMA20_START_ADDR, val)
#define bfin_read_DMA20_CONFIG() bfin_read16(DMA20_CONFIG)
#define bfin_write_DMA20_CONFIG(val) bfin_write16(DMA20_CONFIG, val)
#define bfin_read_DMA20_X_COUNT() bfin_read16(DMA20_X_COUNT)
#define bfin_write_DMA20_X_COUNT(val) bfin_write16(DMA20_X_COUNT, val)
#define bfin_read_DMA20_X_MODIFY() bfin_read16(DMA20_X_MODIFY)
#define bfin_write_DMA20_X_MODIFY(val) bfin_write16(DMA20_X_MODIFY, val)
#define bfin_read_DMA20_Y_COUNT() bfin_read16(DMA20_Y_COUNT)
#define bfin_write_DMA20_Y_COUNT(val) bfin_write16(DMA20_Y_COUNT, val)
#define bfin_read_DMA20_Y_MODIFY() bfin_read16(DMA20_Y_MODIFY)
#define bfin_write_DMA20_Y_MODIFY(val) bfin_write16(DMA20_Y_MODIFY, val)
#define bfin_read_DMA20_CURR_DESC_PTR() bfin_read32(DMA20_CURR_DESC_PTR)
#define bfin_write_DMA20_CURR_DESC_PTR(val) bfin_write32(DMA20_CURR_DESC_PTR, val)
#define bfin_read_DMA20_CURR_ADDR() bfin_read32(DMA20_CURR_ADDR)
#define bfin_write_DMA20_CURR_ADDR(val) bfin_write32(DMA20_CURR_ADDR, val)
#define bfin_read_DMA20_IRQ_STATUS() bfin_read16(DMA20_IRQ_STATUS)
#define bfin_write_DMA20_IRQ_STATUS(val) bfin_write16(DMA20_IRQ_STATUS, val)
#define bfin_read_DMA20_PERIPHERAL_MAP() bfin_read16(DMA20_PERIPHERAL_MAP)
#define bfin_write_DMA20_PERIPHERAL_MAP(val) bfin_write16(DMA20_PERIPHERAL_MAP, val)
#define bfin_read_DMA20_CURR_X_COUNT() bfin_read16(DMA20_CURR_X_COUNT)
#define bfin_write_DMA20_CURR_X_COUNT(val) bfin_write16(DMA20_CURR_X_COUNT, val)
#define bfin_read_DMA20_CURR_Y_COUNT() bfin_read16(DMA20_CURR_Y_COUNT)
#define bfin_write_DMA20_CURR_Y_COUNT(val) bfin_write16(DMA20_CURR_Y_COUNT, val)
/* DMA Channel 21 Registers */
#define bfin_read_DMA21_NEXT_DESC_PTR() bfin_read32(DMA21_NEXT_DESC_PTR)
#define bfin_write_DMA21_NEXT_DESC_PTR(val) bfin_write32(DMA21_NEXT_DESC_PTR, val)
#define bfin_read_DMA21_START_ADDR() bfin_read32(DMA21_START_ADDR)
#define bfin_write_DMA21_START_ADDR(val) bfin_write32(DMA21_START_ADDR, val)
#define bfin_read_DMA21_CONFIG() bfin_read16(DMA21_CONFIG)
#define bfin_write_DMA21_CONFIG(val) bfin_write16(DMA21_CONFIG, val)
#define bfin_read_DMA21_X_COUNT() bfin_read16(DMA21_X_COUNT)
#define bfin_write_DMA21_X_COUNT(val) bfin_write16(DMA21_X_COUNT, val)
#define bfin_read_DMA21_X_MODIFY() bfin_read16(DMA21_X_MODIFY)
#define bfin_write_DMA21_X_MODIFY(val) bfin_write16(DMA21_X_MODIFY, val)
#define bfin_read_DMA21_Y_COUNT() bfin_read16(DMA21_Y_COUNT)
#define bfin_write_DMA21_Y_COUNT(val) bfin_write16(DMA21_Y_COUNT, val)
#define bfin_read_DMA21_Y_MODIFY() bfin_read16(DMA21_Y_MODIFY)
#define bfin_write_DMA21_Y_MODIFY(val) bfin_write16(DMA21_Y_MODIFY, val)
#define bfin_read_DMA21_CURR_DESC_PTR() bfin_read32(DMA21_CURR_DESC_PTR)
#define bfin_write_DMA21_CURR_DESC_PTR(val) bfin_write32(DMA21_CURR_DESC_PTR, val)
#define bfin_read_DMA21_CURR_ADDR() bfin_read32(DMA21_CURR_ADDR)
#define bfin_write_DMA21_CURR_ADDR(val) bfin_write32(DMA21_CURR_ADDR, val)
#define bfin_read_DMA21_IRQ_STATUS() bfin_read16(DMA21_IRQ_STATUS)
#define bfin_write_DMA21_IRQ_STATUS(val) bfin_write16(DMA21_IRQ_STATUS, val)
#define bfin_read_DMA21_PERIPHERAL_MAP() bfin_read16(DMA21_PERIPHERAL_MAP)
#define bfin_write_DMA21_PERIPHERAL_MAP(val) bfin_write16(DMA21_PERIPHERAL_MAP, val)
#define bfin_read_DMA21_CURR_X_COUNT() bfin_read16(DMA21_CURR_X_COUNT)
#define bfin_write_DMA21_CURR_X_COUNT(val) bfin_write16(DMA21_CURR_X_COUNT, val)
#define bfin_read_DMA21_CURR_Y_COUNT() bfin_read16(DMA21_CURR_Y_COUNT)
#define bfin_write_DMA21_CURR_Y_COUNT(val) bfin_write16(DMA21_CURR_Y_COUNT, val)
/* DMA Channel 22 Registers */
#define bfin_read_DMA22_NEXT_DESC_PTR() bfin_read32(DMA22_NEXT_DESC_PTR)
#define bfin_write_DMA22_NEXT_DESC_PTR(val) bfin_write32(DMA22_NEXT_DESC_PTR, val)
#define bfin_read_DMA22_START_ADDR() bfin_read32(DMA22_START_ADDR)
#define bfin_write_DMA22_START_ADDR(val) bfin_write32(DMA22_START_ADDR, val)
#define bfin_read_DMA22_CONFIG() bfin_read16(DMA22_CONFIG)
#define bfin_write_DMA22_CONFIG(val) bfin_write16(DMA22_CONFIG, val)
#define bfin_read_DMA22_X_COUNT() bfin_read16(DMA22_X_COUNT)
#define bfin_write_DMA22_X_COUNT(val) bfin_write16(DMA22_X_COUNT, val)
#define bfin_read_DMA22_X_MODIFY() bfin_read16(DMA22_X_MODIFY)
#define bfin_write_DMA22_X_MODIFY(val) bfin_write16(DMA22_X_MODIFY, val)
#define bfin_read_DMA22_Y_COUNT() bfin_read16(DMA22_Y_COUNT)
#define bfin_write_DMA22_Y_COUNT(val) bfin_write16(DMA22_Y_COUNT, val)
#define bfin_read_DMA22_Y_MODIFY() bfin_read16(DMA22_Y_MODIFY)
#define bfin_write_DMA22_Y_MODIFY(val) bfin_write16(DMA22_Y_MODIFY, val)
#define bfin_read_DMA22_CURR_DESC_PTR() bfin_read32(DMA22_CURR_DESC_PTR)
#define bfin_write_DMA22_CURR_DESC_PTR(val) bfin_write32(DMA22_CURR_DESC_PTR, val)
#define bfin_read_DMA22_CURR_ADDR() bfin_read32(DMA22_CURR_ADDR)
#define bfin_write_DMA22_CURR_ADDR(val) bfin_write32(DMA22_CURR_ADDR, val)
#define bfin_read_DMA22_IRQ_STATUS() bfin_read16(DMA22_IRQ_STATUS)
#define bfin_write_DMA22_IRQ_STATUS(val) bfin_write16(DMA22_IRQ_STATUS, val)
#define bfin_read_DMA22_PERIPHERAL_MAP() bfin_read16(DMA22_PERIPHERAL_MAP)
#define bfin_write_DMA22_PERIPHERAL_MAP(val) bfin_write16(DMA22_PERIPHERAL_MAP, val)
#define bfin_read_DMA22_CURR_X_COUNT() bfin_read16(DMA22_CURR_X_COUNT)
#define bfin_write_DMA22_CURR_X_COUNT(val) bfin_write16(DMA22_CURR_X_COUNT, val)
#define bfin_read_DMA22_CURR_Y_COUNT() bfin_read16(DMA22_CURR_Y_COUNT)
#define bfin_write_DMA22_CURR_Y_COUNT(val) bfin_write16(DMA22_CURR_Y_COUNT, val)
/* DMA Channel 23 Registers */
#define bfin_read_DMA23_NEXT_DESC_PTR() bfin_read32(DMA23_NEXT_DESC_PTR)
#define bfin_write_DMA23_NEXT_DESC_PTR(val) bfin_write32(DMA23_NEXT_DESC_PTR, val)
#define bfin_read_DMA23_START_ADDR() bfin_read32(DMA23_START_ADDR)
#define bfin_write_DMA23_START_ADDR(val) bfin_write32(DMA23_START_ADDR, val)
#define bfin_read_DMA23_CONFIG() bfin_read16(DMA23_CONFIG)
#define bfin_write_DMA23_CONFIG(val) bfin_write16(DMA23_CONFIG, val)
#define bfin_read_DMA23_X_COUNT() bfin_read16(DMA23_X_COUNT)
#define bfin_write_DMA23_X_COUNT(val) bfin_write16(DMA23_X_COUNT, val)
#define bfin_read_DMA23_X_MODIFY() bfin_read16(DMA23_X_MODIFY)
#define bfin_write_DMA23_X_MODIFY(val) bfin_write16(DMA23_X_MODIFY, val)
#define bfin_read_DMA23_Y_COUNT() bfin_read16(DMA23_Y_COUNT)
#define bfin_write_DMA23_Y_COUNT(val) bfin_write16(DMA23_Y_COUNT, val)
#define bfin_read_DMA23_Y_MODIFY() bfin_read16(DMA23_Y_MODIFY)
#define bfin_write_DMA23_Y_MODIFY(val) bfin_write16(DMA23_Y_MODIFY, val)
#define bfin_read_DMA23_CURR_DESC_PTR() bfin_read32(DMA23_CURR_DESC_PTR)
#define bfin_write_DMA23_CURR_DESC_PTR(val) bfin_write32(DMA23_CURR_DESC_PTR, val)
#define bfin_read_DMA23_CURR_ADDR() bfin_read32(DMA23_CURR_ADDR)
#define bfin_write_DMA23_CURR_ADDR(val) bfin_write32(DMA23_CURR_ADDR, val)
#define bfin_read_DMA23_IRQ_STATUS() bfin_read16(DMA23_IRQ_STATUS)
#define bfin_write_DMA23_IRQ_STATUS(val) bfin_write16(DMA23_IRQ_STATUS, val)
#define bfin_read_DMA23_PERIPHERAL_MAP() bfin_read16(DMA23_PERIPHERAL_MAP)
#define bfin_write_DMA23_PERIPHERAL_MAP(val) bfin_write16(DMA23_PERIPHERAL_MAP, val)
#define bfin_read_DMA23_CURR_X_COUNT() bfin_read16(DMA23_CURR_X_COUNT)
#define bfin_write_DMA23_CURR_X_COUNT(val) bfin_write16(DMA23_CURR_X_COUNT, val)
#define bfin_read_DMA23_CURR_Y_COUNT() bfin_read16(DMA23_CURR_Y_COUNT)
#define bfin_write_DMA23_CURR_Y_COUNT(val) bfin_write16(DMA23_CURR_Y_COUNT, val)
/* MDMA Stream 2 Registers */
#define bfin_read_MDMA_D2_NEXT_DESC_PTR() bfin_read32(MDMA_D2_NEXT_DESC_PTR)
#define bfin_write_MDMA_D2_NEXT_DESC_PTR(val) bfin_write32(MDMA_D2_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_D2_START_ADDR() bfin_read32(MDMA_D2_START_ADDR)
#define bfin_write_MDMA_D2_START_ADDR(val) bfin_write32(MDMA_D2_START_ADDR, val)
#define bfin_read_MDMA_D2_CONFIG() bfin_read16(MDMA_D2_CONFIG)
#define bfin_write_MDMA_D2_CONFIG(val) bfin_write16(MDMA_D2_CONFIG, val)
#define bfin_read_MDMA_D2_X_COUNT() bfin_read16(MDMA_D2_X_COUNT)
#define bfin_write_MDMA_D2_X_COUNT(val) bfin_write16(MDMA_D2_X_COUNT, val)
#define bfin_read_MDMA_D2_X_MODIFY() bfin_read16(MDMA_D2_X_MODIFY)
#define bfin_write_MDMA_D2_X_MODIFY(val) bfin_write16(MDMA_D2_X_MODIFY, val)
#define bfin_read_MDMA_D2_Y_COUNT() bfin_read16(MDMA_D2_Y_COUNT)
#define bfin_write_MDMA_D2_Y_COUNT(val) bfin_write16(MDMA_D2_Y_COUNT, val)
#define bfin_read_MDMA_D2_Y_MODIFY() bfin_read16(MDMA_D2_Y_MODIFY)
#define bfin_write_MDMA_D2_Y_MODIFY(val) bfin_write16(MDMA_D2_Y_MODIFY, val)
#define bfin_read_MDMA_D2_CURR_DESC_PTR() bfin_read32(MDMA_D2_CURR_DESC_PTR)
#define bfin_write_MDMA_D2_CURR_DESC_PTR(val) bfin_write32(MDMA_D2_CURR_DESC_PTR, val)
#define bfin_read_MDMA_D2_CURR_ADDR() bfin_read32(MDMA_D2_CURR_ADDR)
#define bfin_write_MDMA_D2_CURR_ADDR(val) bfin_write32(MDMA_D2_CURR_ADDR, val)
#define bfin_read_MDMA_D2_IRQ_STATUS() bfin_read16(MDMA_D2_IRQ_STATUS)
#define bfin_write_MDMA_D2_IRQ_STATUS(val) bfin_write16(MDMA_D2_IRQ_STATUS, val)
#define bfin_read_MDMA_D2_PERIPHERAL_MAP() bfin_read16(MDMA_D2_PERIPHERAL_MAP)
#define bfin_write_MDMA_D2_PERIPHERAL_MAP(val) bfin_write16(MDMA_D2_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_D2_CURR_X_COUNT() bfin_read16(MDMA_D2_CURR_X_COUNT)
#define bfin_write_MDMA_D2_CURR_X_COUNT(val) bfin_write16(MDMA_D2_CURR_X_COUNT, val)
#define bfin_read_MDMA_D2_CURR_Y_COUNT() bfin_read16(MDMA_D2_CURR_Y_COUNT)
#define bfin_write_MDMA_D2_CURR_Y_COUNT(val) bfin_write16(MDMA_D2_CURR_Y_COUNT, val)
#define bfin_read_MDMA_S2_NEXT_DESC_PTR() bfin_read32(MDMA_S2_NEXT_DESC_PTR)
#define bfin_write_MDMA_S2_NEXT_DESC_PTR(val) bfin_write32(MDMA_S2_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_S2_START_ADDR() bfin_read32(MDMA_S2_START_ADDR)
#define bfin_write_MDMA_S2_START_ADDR(val) bfin_write32(MDMA_S2_START_ADDR, val)
#define bfin_read_MDMA_S2_CONFIG() bfin_read16(MDMA_S2_CONFIG)
#define bfin_write_MDMA_S2_CONFIG(val) bfin_write16(MDMA_S2_CONFIG, val)
#define bfin_read_MDMA_S2_X_COUNT() bfin_read16(MDMA_S2_X_COUNT)
#define bfin_write_MDMA_S2_X_COUNT(val) bfin_write16(MDMA_S2_X_COUNT, val)
#define bfin_read_MDMA_S2_X_MODIFY() bfin_read16(MDMA_S2_X_MODIFY)
#define bfin_write_MDMA_S2_X_MODIFY(val) bfin_write16(MDMA_S2_X_MODIFY, val)
#define bfin_read_MDMA_S2_Y_COUNT() bfin_read16(MDMA_S2_Y_COUNT)
#define bfin_write_MDMA_S2_Y_COUNT(val) bfin_write16(MDMA_S2_Y_COUNT, val)
#define bfin_read_MDMA_S2_Y_MODIFY() bfin_read16(MDMA_S2_Y_MODIFY)
#define bfin_write_MDMA_S2_Y_MODIFY(val) bfin_write16(MDMA_S2_Y_MODIFY, val)
#define bfin_read_MDMA_S2_CURR_DESC_PTR() bfin_read32(MDMA_S2_CURR_DESC_PTR)
#define bfin_write_MDMA_S2_CURR_DESC_PTR(val) bfin_write32(MDMA_S2_CURR_DESC_PTR, val)
#define bfin_read_MDMA_S2_CURR_ADDR() bfin_read32(MDMA_S2_CURR_ADDR)
#define bfin_write_MDMA_S2_CURR_ADDR(val) bfin_write32(MDMA_S2_CURR_ADDR, val)
#define bfin_read_MDMA_S2_IRQ_STATUS() bfin_read16(MDMA_S2_IRQ_STATUS)
#define bfin_write_MDMA_S2_IRQ_STATUS(val) bfin_write16(MDMA_S2_IRQ_STATUS, val)
#define bfin_read_MDMA_S2_PERIPHERAL_MAP() bfin_read16(MDMA_S2_PERIPHERAL_MAP)
#define bfin_write_MDMA_S2_PERIPHERAL_MAP(val) bfin_write16(MDMA_S2_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_S2_CURR_X_COUNT() bfin_read16(MDMA_S2_CURR_X_COUNT)
#define bfin_write_MDMA_S2_CURR_X_COUNT(val) bfin_write16(MDMA_S2_CURR_X_COUNT, val)
#define bfin_read_MDMA_S2_CURR_Y_COUNT() bfin_read16(MDMA_S2_CURR_Y_COUNT)
#define bfin_write_MDMA_S2_CURR_Y_COUNT(val) bfin_write16(MDMA_S2_CURR_Y_COUNT, val)
/* MDMA Stream 3 Registers */
#define bfin_read_MDMA_D3_NEXT_DESC_PTR() bfin_read32(MDMA_D3_NEXT_DESC_PTR)
#define bfin_write_MDMA_D3_NEXT_DESC_PTR(val) bfin_write32(MDMA_D3_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_D3_START_ADDR() bfin_read32(MDMA_D3_START_ADDR)
#define bfin_write_MDMA_D3_START_ADDR(val) bfin_write32(MDMA_D3_START_ADDR, val)
#define bfin_read_MDMA_D3_CONFIG() bfin_read16(MDMA_D3_CONFIG)
#define bfin_write_MDMA_D3_CONFIG(val) bfin_write16(MDMA_D3_CONFIG, val)
#define bfin_read_MDMA_D3_X_COUNT() bfin_read16(MDMA_D3_X_COUNT)
#define bfin_write_MDMA_D3_X_COUNT(val) bfin_write16(MDMA_D3_X_COUNT, val)
#define bfin_read_MDMA_D3_X_MODIFY() bfin_read16(MDMA_D3_X_MODIFY)
#define bfin_write_MDMA_D3_X_MODIFY(val) bfin_write16(MDMA_D3_X_MODIFY, val)
#define bfin_read_MDMA_D3_Y_COUNT() bfin_read16(MDMA_D3_Y_COUNT)
#define bfin_write_MDMA_D3_Y_COUNT(val) bfin_write16(MDMA_D3_Y_COUNT, val)
#define bfin_read_MDMA_D3_Y_MODIFY() bfin_read16(MDMA_D3_Y_MODIFY)
#define bfin_write_MDMA_D3_Y_MODIFY(val) bfin_write16(MDMA_D3_Y_MODIFY, val)
#define bfin_read_MDMA_D3_CURR_DESC_PTR() bfin_read32(MDMA_D3_CURR_DESC_PTR)
#define bfin_write_MDMA_D3_CURR_DESC_PTR(val) bfin_write32(MDMA_D3_CURR_DESC_PTR, val)
#define bfin_read_MDMA_D3_CURR_ADDR() bfin_read32(MDMA_D3_CURR_ADDR)
#define bfin_write_MDMA_D3_CURR_ADDR(val) bfin_write32(MDMA_D3_CURR_ADDR, val)
#define bfin_read_MDMA_D3_IRQ_STATUS() bfin_read16(MDMA_D3_IRQ_STATUS)
#define bfin_write_MDMA_D3_IRQ_STATUS(val) bfin_write16(MDMA_D3_IRQ_STATUS, val)
#define bfin_read_MDMA_D3_PERIPHERAL_MAP() bfin_read16(MDMA_D3_PERIPHERAL_MAP)
#define bfin_write_MDMA_D3_PERIPHERAL_MAP(val) bfin_write16(MDMA_D3_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_D3_CURR_X_COUNT() bfin_read16(MDMA_D3_CURR_X_COUNT)
#define bfin_write_MDMA_D3_CURR_X_COUNT(val) bfin_write16(MDMA_D3_CURR_X_COUNT, val)
#define bfin_read_MDMA_D3_CURR_Y_COUNT() bfin_read16(MDMA_D3_CURR_Y_COUNT)
#define bfin_write_MDMA_D3_CURR_Y_COUNT(val) bfin_write16(MDMA_D3_CURR_Y_COUNT, val)
#define bfin_read_MDMA_S3_NEXT_DESC_PTR() bfin_read32(MDMA_S3_NEXT_DESC_PTR)
#define bfin_write_MDMA_S3_NEXT_DESC_PTR(val) bfin_write32(MDMA_S3_NEXT_DESC_PTR, val)
#define bfin_read_MDMA_S3_START_ADDR() bfin_read32(MDMA_S3_START_ADDR)
#define bfin_write_MDMA_S3_START_ADDR(val) bfin_write32(MDMA_S3_START_ADDR, val)
#define bfin_read_MDMA_S3_CONFIG() bfin_read16(MDMA_S3_CONFIG)
#define bfin_write_MDMA_S3_CONFIG(val) bfin_write16(MDMA_S3_CONFIG, val)
#define bfin_read_MDMA_S3_X_COUNT() bfin_read16(MDMA_S3_X_COUNT)
#define bfin_write_MDMA_S3_X_COUNT(val) bfin_write16(MDMA_S3_X_COUNT, val)
#define bfin_read_MDMA_S3_X_MODIFY() bfin_read16(MDMA_S3_X_MODIFY)
#define bfin_write_MDMA_S3_X_MODIFY(val) bfin_write16(MDMA_S3_X_MODIFY, val)
#define bfin_read_MDMA_S3_Y_COUNT() bfin_read16(MDMA_S3_Y_COUNT)
#define bfin_write_MDMA_S3_Y_COUNT(val) bfin_write16(MDMA_S3_Y_COUNT, val)
#define bfin_read_MDMA_S3_Y_MODIFY() bfin_read16(MDMA_S3_Y_MODIFY)
#define bfin_write_MDMA_S3_Y_MODIFY(val) bfin_write16(MDMA_S3_Y_MODIFY, val)
#define bfin_read_MDMA_S3_CURR_DESC_PTR() bfin_read32(MDMA_S3_CURR_DESC_PTR)
#define bfin_write_MDMA_S3_CURR_DESC_PTR(val) bfin_write32(MDMA_S3_CURR_DESC_PTR, val)
#define bfin_read_MDMA_S3_CURR_ADDR() bfin_read32(MDMA_S3_CURR_ADDR)
#define bfin_write_MDMA_S3_CURR_ADDR(val) bfin_write32(MDMA_S3_CURR_ADDR, val)
#define bfin_read_MDMA_S3_IRQ_STATUS() bfin_read16(MDMA_S3_IRQ_STATUS)
#define bfin_write_MDMA_S3_IRQ_STATUS(val) bfin_write16(MDMA_S3_IRQ_STATUS, val)
#define bfin_read_MDMA_S3_PERIPHERAL_MAP() bfin_read16(MDMA_S3_PERIPHERAL_MAP)
#define bfin_write_MDMA_S3_PERIPHERAL_MAP(val) bfin_write16(MDMA_S3_PERIPHERAL_MAP, val)
#define bfin_read_MDMA_S3_CURR_X_COUNT() bfin_read16(MDMA_S3_CURR_X_COUNT)
#define bfin_write_MDMA_S3_CURR_X_COUNT(val) bfin_write16(MDMA_S3_CURR_X_COUNT, val)
#define bfin_read_MDMA_S3_CURR_Y_COUNT() bfin_read16(MDMA_S3_CURR_Y_COUNT)
#define bfin_write_MDMA_S3_CURR_Y_COUNT(val) bfin_write16(MDMA_S3_CURR_Y_COUNT, val)
/* UART1 Registers */
#define bfin_read_UART1_DLL() bfin_read16(UART1_DLL)
#define bfin_write_UART1_DLL(val) bfin_write16(UART1_DLL, val)
#define bfin_read_UART1_DLH() bfin_read16(UART1_DLH)
#define bfin_write_UART1_DLH(val) bfin_write16(UART1_DLH, val)
#define bfin_read_UART1_GCTL() bfin_read16(UART1_GCTL)
#define bfin_write_UART1_GCTL(val) bfin_write16(UART1_GCTL, val)
#define bfin_read_UART1_LCR() bfin_read16(UART1_LCR)
#define bfin_write_UART1_LCR(val) bfin_write16(UART1_LCR, val)
#define bfin_read_UART1_MCR() bfin_read16(UART1_MCR)
#define bfin_write_UART1_MCR(val) bfin_write16(UART1_MCR, val)
#define bfin_read_UART1_LSR() bfin_read16(UART1_LSR)
#define bfin_write_UART1_LSR(val) bfin_write16(UART1_LSR, val)
#define bfin_read_UART1_MSR() bfin_read16(UART1_MSR)
#define bfin_write_UART1_MSR(val) bfin_write16(UART1_MSR, val)
#define bfin_read_UART1_SCR() bfin_read16(UART1_SCR)
#define bfin_write_UART1_SCR(val) bfin_write16(UART1_SCR, val)
#define bfin_read_UART1_IER_SET() bfin_read16(UART1_IER_SET)
#define bfin_write_UART1_IER_SET(val) bfin_write16(UART1_IER_SET, val)
#define bfin_read_UART1_IER_CLEAR() bfin_read16(UART1_IER_CLEAR)
#define bfin_write_UART1_IER_CLEAR(val) bfin_write16(UART1_IER_CLEAR, val)
#define bfin_read_UART1_THR() bfin_read16(UART1_THR)
#define bfin_write_UART1_THR(val) bfin_write16(UART1_THR, val)
#define bfin_read_UART1_RBR() bfin_read16(UART1_RBR)
#define bfin_write_UART1_RBR(val) bfin_write16(UART1_RBR, val)
/* UART2 is not defined in the shared file because it is not available on the ADSP-BF542 and ADSP-BF544 bfin_read_()rocessors */
/* SPI1 Registers */
#define bfin_read_SPI1_CTL() bfin_read16(SPI1_CTL)
#define bfin_write_SPI1_CTL(val) bfin_write16(SPI1_CTL, val)
#define bfin_read_SPI1_FLG() bfin_read16(SPI1_FLG)
#define bfin_write_SPI1_FLG(val) bfin_write16(SPI1_FLG, val)
#define bfin_read_SPI1_STAT() bfin_read16(SPI1_STAT)
#define bfin_write_SPI1_STAT(val) bfin_write16(SPI1_STAT, val)
#define bfin_read_SPI1_TDBR() bfin_read16(SPI1_TDBR)
#define bfin_write_SPI1_TDBR(val) bfin_write16(SPI1_TDBR, val)
#define bfin_read_SPI1_RDBR() bfin_read16(SPI1_RDBR)
#define bfin_write_SPI1_RDBR(val) bfin_write16(SPI1_RDBR, val)
#define bfin_read_SPI1_BAUD() bfin_read16(SPI1_BAUD)
#define bfin_write_SPI1_BAUD(val) bfin_write16(SPI1_BAUD, val)
#define bfin_read_SPI1_SHADOW() bfin_read16(SPI1_SHADOW)
#define bfin_write_SPI1_SHADOW(val) bfin_write16(SPI1_SHADOW, val)
/* SPORT2 Registers */
#define bfin_read_SPORT2_TCR1() bfin_read16(SPORT2_TCR1)
#define bfin_write_SPORT2_TCR1(val) bfin_write16(SPORT2_TCR1, val)
#define bfin_read_SPORT2_TCR2() bfin_read16(SPORT2_TCR2)
#define bfin_write_SPORT2_TCR2(val) bfin_write16(SPORT2_TCR2, val)
#define bfin_read_SPORT2_TCLKDIV() bfin_read16(SPORT2_TCLKDIV)
#define bfin_write_SPORT2_TCLKDIV(val) bfin_write16(SPORT2_TCLKDIV, val)
#define bfin_read_SPORT2_TFSDIV() bfin_read16(SPORT2_TFSDIV)
#define bfin_write_SPORT2_TFSDIV(val) bfin_write16(SPORT2_TFSDIV, val)
#define bfin_read_SPORT2_TX() bfin_read32(SPORT2_TX)
#define bfin_write_SPORT2_TX(val) bfin_write32(SPORT2_TX, val)
#define bfin_read_SPORT2_RX() bfin_read32(SPORT2_RX)
#define bfin_write_SPORT2_RX(val) bfin_write32(SPORT2_RX, val)
#define bfin_read_SPORT2_RCR1() bfin_read16(SPORT2_RCR1)
#define bfin_write_SPORT2_RCR1(val) bfin_write16(SPORT2_RCR1, val)
#define bfin_read_SPORT2_RCR2() bfin_read16(SPORT2_RCR2)
#define bfin_write_SPORT2_RCR2(val) bfin_write16(SPORT2_RCR2, val)
#define bfin_read_SPORT2_RCLKDIV() bfin_read16(SPORT2_RCLKDIV)
#define bfin_write_SPORT2_RCLKDIV(val) bfin_write16(SPORT2_RCLKDIV, val)
#define bfin_read_SPORT2_RFSDIV() bfin_read16(SPORT2_RFSDIV)
#define bfin_write_SPORT2_RFSDIV(val) bfin_write16(SPORT2_RFSDIV, val)
#define bfin_read_SPORT2_STAT() bfin_read16(SPORT2_STAT)
#define bfin_write_SPORT2_STAT(val) bfin_write16(SPORT2_STAT, val)
#define bfin_read_SPORT2_CHNL() bfin_read16(SPORT2_CHNL)
#define bfin_write_SPORT2_CHNL(val) bfin_write16(SPORT2_CHNL, val)
#define bfin_read_SPORT2_MCMC1() bfin_read16(SPORT2_MCMC1)
#define bfin_write_SPORT2_MCMC1(val) bfin_write16(SPORT2_MCMC1, val)
#define bfin_read_SPORT2_MCMC2() bfin_read16(SPORT2_MCMC2)
#define bfin_write_SPORT2_MCMC2(val) bfin_write16(SPORT2_MCMC2, val)
#define bfin_read_SPORT2_MTCS0() bfin_read32(SPORT2_MTCS0)
#define bfin_write_SPORT2_MTCS0(val) bfin_write32(SPORT2_MTCS0, val)
#define bfin_read_SPORT2_MTCS1() bfin_read32(SPORT2_MTCS1)
#define bfin_write_SPORT2_MTCS1(val) bfin_write32(SPORT2_MTCS1, val)
#define bfin_read_SPORT2_MTCS2() bfin_read32(SPORT2_MTCS2)
#define bfin_write_SPORT2_MTCS2(val) bfin_write32(SPORT2_MTCS2, val)
#define bfin_read_SPORT2_MTCS3() bfin_read32(SPORT2_MTCS3)
#define bfin_write_SPORT2_MTCS3(val) bfin_write32(SPORT2_MTCS3, val)
#define bfin_read_SPORT2_MRCS0() bfin_read32(SPORT2_MRCS0)
#define bfin_write_SPORT2_MRCS0(val) bfin_write32(SPORT2_MRCS0, val)
#define bfin_read_SPORT2_MRCS1() bfin_read32(SPORT2_MRCS1)
#define bfin_write_SPORT2_MRCS1(val) bfin_write32(SPORT2_MRCS1, val)
#define bfin_read_SPORT2_MRCS2() bfin_read32(SPORT2_MRCS2)
#define bfin_write_SPORT2_MRCS2(val) bfin_write32(SPORT2_MRCS2, val)
#define bfin_read_SPORT2_MRCS3() bfin_read32(SPORT2_MRCS3)
#define bfin_write_SPORT2_MRCS3(val) bfin_write32(SPORT2_MRCS3, val)
/* SPORT3 Registers */
#define bfin_read_SPORT3_TCR1() bfin_read16(SPORT3_TCR1)
#define bfin_write_SPORT3_TCR1(val) bfin_write16(SPORT3_TCR1, val)
#define bfin_read_SPORT3_TCR2() bfin_read16(SPORT3_TCR2)
#define bfin_write_SPORT3_TCR2(val) bfin_write16(SPORT3_TCR2, val)
#define bfin_read_SPORT3_TCLKDIV() bfin_read16(SPORT3_TCLKDIV)
#define bfin_write_SPORT3_TCLKDIV(val) bfin_write16(SPORT3_TCLKDIV, val)
#define bfin_read_SPORT3_TFSDIV() bfin_read16(SPORT3_TFSDIV)
#define bfin_write_SPORT3_TFSDIV(val) bfin_write16(SPORT3_TFSDIV, val)
#define bfin_read_SPORT3_TX() bfin_read32(SPORT3_TX)
#define bfin_write_SPORT3_TX(val) bfin_write32(SPORT3_TX, val)
#define bfin_read_SPORT3_RX() bfin_read32(SPORT3_RX)
#define bfin_write_SPORT3_RX(val) bfin_write32(SPORT3_RX, val)
#define bfin_read_SPORT3_RCR1() bfin_read16(SPORT3_RCR1)
#define bfin_write_SPORT3_RCR1(val) bfin_write16(SPORT3_RCR1, val)
#define bfin_read_SPORT3_RCR2() bfin_read16(SPORT3_RCR2)
#define bfin_write_SPORT3_RCR2(val) bfin_write16(SPORT3_RCR2, val)
#define bfin_read_SPORT3_RCLKDIV() bfin_read16(SPORT3_RCLKDIV)
#define bfin_write_SPORT3_RCLKDIV(val) bfin_write16(SPORT3_RCLKDIV, val)
#define bfin_read_SPORT3_RFSDIV() bfin_read16(SPORT3_RFSDIV)
#define bfin_write_SPORT3_RFSDIV(val) bfin_write16(SPORT3_RFSDIV, val)
#define bfin_read_SPORT3_STAT() bfin_read16(SPORT3_STAT)
#define bfin_write_SPORT3_STAT(val) bfin_write16(SPORT3_STAT, val)
#define bfin_read_SPORT3_CHNL() bfin_read16(SPORT3_CHNL)
#define bfin_write_SPORT3_CHNL(val) bfin_write16(SPORT3_CHNL, val)
#define bfin_read_SPORT3_MCMC1() bfin_read16(SPORT3_MCMC1)
#define bfin_write_SPORT3_MCMC1(val) bfin_write16(SPORT3_MCMC1, val)
#define bfin_read_SPORT3_MCMC2() bfin_read16(SPORT3_MCMC2)
#define bfin_write_SPORT3_MCMC2(val) bfin_write16(SPORT3_MCMC2, val)
#define bfin_read_SPORT3_MTCS0() bfin_read32(SPORT3_MTCS0)
#define bfin_write_SPORT3_MTCS0(val) bfin_write32(SPORT3_MTCS0, val)
#define bfin_read_SPORT3_MTCS1() bfin_read32(SPORT3_MTCS1)
#define bfin_write_SPORT3_MTCS1(val) bfin_write32(SPORT3_MTCS1, val)
#define bfin_read_SPORT3_MTCS2() bfin_read32(SPORT3_MTCS2)
#define bfin_write_SPORT3_MTCS2(val) bfin_write32(SPORT3_MTCS2, val)
#define bfin_read_SPORT3_MTCS3() bfin_read32(SPORT3_MTCS3)
#define bfin_write_SPORT3_MTCS3(val) bfin_write32(SPORT3_MTCS3, val)
#define bfin_read_SPORT3_MRCS0() bfin_read32(SPORT3_MRCS0)
#define bfin_write_SPORT3_MRCS0(val) bfin_write32(SPORT3_MRCS0, val)
#define bfin_read_SPORT3_MRCS1() bfin_read32(SPORT3_MRCS1)
#define bfin_write_SPORT3_MRCS1(val) bfin_write32(SPORT3_MRCS1, val)
#define bfin_read_SPORT3_MRCS2() bfin_read32(SPORT3_MRCS2)
#define bfin_write_SPORT3_MRCS2(val) bfin_write32(SPORT3_MRCS2, val)
#define bfin_read_SPORT3_MRCS3() bfin_read32(SPORT3_MRCS3)
#define bfin_write_SPORT3_MRCS3(val) bfin_write32(SPORT3_MRCS3, val)
/* EPPI2 Registers */
#define bfin_read_EPPI2_STATUS() bfin_read16(EPPI2_STATUS)
#define bfin_write_EPPI2_STATUS(val) bfin_write16(EPPI2_STATUS, val)
#define bfin_read_EPPI2_HCOUNT() bfin_read16(EPPI2_HCOUNT)
#define bfin_write_EPPI2_HCOUNT(val) bfin_write16(EPPI2_HCOUNT, val)
#define bfin_read_EPPI2_HDELAY() bfin_read16(EPPI2_HDELAY)
#define bfin_write_EPPI2_HDELAY(val) bfin_write16(EPPI2_HDELAY, val)
#define bfin_read_EPPI2_VCOUNT() bfin_read16(EPPI2_VCOUNT)
#define bfin_write_EPPI2_VCOUNT(val) bfin_write16(EPPI2_VCOUNT, val)
#define bfin_read_EPPI2_VDELAY() bfin_read16(EPPI2_VDELAY)
#define bfin_write_EPPI2_VDELAY(val) bfin_write16(EPPI2_VDELAY, val)
#define bfin_read_EPPI2_FRAME() bfin_read16(EPPI2_FRAME)
#define bfin_write_EPPI2_FRAME(val) bfin_write16(EPPI2_FRAME, val)
#define bfin_read_EPPI2_LINE() bfin_read16(EPPI2_LINE)
#define bfin_write_EPPI2_LINE(val) bfin_write16(EPPI2_LINE, val)
#define bfin_read_EPPI2_CLKDIV() bfin_read16(EPPI2_CLKDIV)
#define bfin_write_EPPI2_CLKDIV(val) bfin_write16(EPPI2_CLKDIV, val)
#define bfin_read_EPPI2_CONTROL() bfin_read32(EPPI2_CONTROL)
#define bfin_write_EPPI2_CONTROL(val) bfin_write32(EPPI2_CONTROL, val)
#define bfin_read_EPPI2_FS1W_HBL() bfin_read32(EPPI2_FS1W_HBL)
#define bfin_write_EPPI2_FS1W_HBL(val) bfin_write32(EPPI2_FS1W_HBL, val)
#define bfin_read_EPPI2_FS1P_AVPL() bfin_read32(EPPI2_FS1P_AVPL)
#define bfin_write_EPPI2_FS1P_AVPL(val) bfin_write32(EPPI2_FS1P_AVPL, val)
#define bfin_read_EPPI2_FS2W_LVB() bfin_read32(EPPI2_FS2W_LVB)
#define bfin_write_EPPI2_FS2W_LVB(val) bfin_write32(EPPI2_FS2W_LVB, val)
#define bfin_read_EPPI2_FS2P_LAVF() bfin_read32(EPPI2_FS2P_LAVF)
#define bfin_write_EPPI2_FS2P_LAVF(val) bfin_write32(EPPI2_FS2P_LAVF, val)
#define bfin_read_EPPI2_CLIP() bfin_read32(EPPI2_CLIP)
#define bfin_write_EPPI2_CLIP(val) bfin_write32(EPPI2_CLIP, val)
/* CAN Controller 0 Config 1 Registers */
#define bfin_read_CAN0_MC1() bfin_read16(CAN0_MC1)
#define bfin_write_CAN0_MC1(val) bfin_write16(CAN0_MC1, val)
#define bfin_read_CAN0_MD1() bfin_read16(CAN0_MD1)
#define bfin_write_CAN0_MD1(val) bfin_write16(CAN0_MD1, val)
#define bfin_read_CAN0_TRS1() bfin_read16(CAN0_TRS1)
#define bfin_write_CAN0_TRS1(val) bfin_write16(CAN0_TRS1, val)
#define bfin_read_CAN0_TRR1() bfin_read16(CAN0_TRR1)
#define bfin_write_CAN0_TRR1(val) bfin_write16(CAN0_TRR1, val)
#define bfin_read_CAN0_TA1() bfin_read16(CAN0_TA1)
#define bfin_write_CAN0_TA1(val) bfin_write16(CAN0_TA1, val)
#define bfin_read_CAN0_AA1() bfin_read16(CAN0_AA1)
#define bfin_write_CAN0_AA1(val) bfin_write16(CAN0_AA1, val)
#define bfin_read_CAN0_RMP1() bfin_read16(CAN0_RMP1)
#define bfin_write_CAN0_RMP1(val) bfin_write16(CAN0_RMP1, val)
#define bfin_read_CAN0_RML1() bfin_read16(CAN0_RML1)
#define bfin_write_CAN0_RML1(val) bfin_write16(CAN0_RML1, val)
#define bfin_read_CAN0_MBTIF1() bfin_read16(CAN0_MBTIF1)
#define bfin_write_CAN0_MBTIF1(val) bfin_write16(CAN0_MBTIF1, val)
#define bfin_read_CAN0_MBRIF1() bfin_read16(CAN0_MBRIF1)
#define bfin_write_CAN0_MBRIF1(val) bfin_write16(CAN0_MBRIF1, val)
#define bfin_read_CAN0_MBIM1() bfin_read16(CAN0_MBIM1)
#define bfin_write_CAN0_MBIM1(val) bfin_write16(CAN0_MBIM1, val)
#define bfin_read_CAN0_RFH1() bfin_read16(CAN0_RFH1)
#define bfin_write_CAN0_RFH1(val) bfin_write16(CAN0_RFH1, val)
#define bfin_read_CAN0_OPSS1() bfin_read16(CAN0_OPSS1)
#define bfin_write_CAN0_OPSS1(val) bfin_write16(CAN0_OPSS1, val)
/* CAN Controller 0 Config 2 Registers */
#define bfin_read_CAN0_MC2() bfin_read16(CAN0_MC2)
#define bfin_write_CAN0_MC2(val) bfin_write16(CAN0_MC2, val)
#define bfin_read_CAN0_MD2() bfin_read16(CAN0_MD2)
#define bfin_write_CAN0_MD2(val) bfin_write16(CAN0_MD2, val)
#define bfin_read_CAN0_TRS2() bfin_read16(CAN0_TRS2)
#define bfin_write_CAN0_TRS2(val) bfin_write16(CAN0_TRS2, val)
#define bfin_read_CAN0_TRR2() bfin_read16(CAN0_TRR2)
#define bfin_write_CAN0_TRR2(val) bfin_write16(CAN0_TRR2, val)
#define bfin_read_CAN0_TA2() bfin_read16(CAN0_TA2)
#define bfin_write_CAN0_TA2(val) bfin_write16(CAN0_TA2, val)
#define bfin_read_CAN0_AA2() bfin_read16(CAN0_AA2)
#define bfin_write_CAN0_AA2(val) bfin_write16(CAN0_AA2, val)
#define bfin_read_CAN0_RMP2() bfin_read16(CAN0_RMP2)
#define bfin_write_CAN0_RMP2(val) bfin_write16(CAN0_RMP2, val)
#define bfin_read_CAN0_RML2() bfin_read16(CAN0_RML2)
#define bfin_write_CAN0_RML2(val) bfin_write16(CAN0_RML2, val)
#define bfin_read_CAN0_MBTIF2() bfin_read16(CAN0_MBTIF2)
#define bfin_write_CAN0_MBTIF2(val) bfin_write16(CAN0_MBTIF2, val)
#define bfin_read_CAN0_MBRIF2() bfin_read16(CAN0_MBRIF2)
#define bfin_write_CAN0_MBRIF2(val) bfin_write16(CAN0_MBRIF2, val)
#define bfin_read_CAN0_MBIM2() bfin_read16(CAN0_MBIM2)
#define bfin_write_CAN0_MBIM2(val) bfin_write16(CAN0_MBIM2, val)
#define bfin_read_CAN0_RFH2() bfin_read16(CAN0_RFH2)
#define bfin_write_CAN0_RFH2(val) bfin_write16(CAN0_RFH2, val)
#define bfin_read_CAN0_OPSS2() bfin_read16(CAN0_OPSS2)
#define bfin_write_CAN0_OPSS2(val) bfin_write16(CAN0_OPSS2, val)
/* CAN Controller 0 Clock/Interrubfin_read_()t/Counter Registers */
#define bfin_read_CAN0_CLOCK() bfin_read16(CAN0_CLOCK)
#define bfin_write_CAN0_CLOCK(val) bfin_write16(CAN0_CLOCK, val)
#define bfin_read_CAN0_TIMING() bfin_read16(CAN0_TIMING)
#define bfin_write_CAN0_TIMING(val) bfin_write16(CAN0_TIMING, val)
#define bfin_read_CAN0_DEBUG() bfin_read16(CAN0_DEBUG)
#define bfin_write_CAN0_DEBUG(val) bfin_write16(CAN0_DEBUG, val)
#define bfin_read_CAN0_STATUS() bfin_read16(CAN0_STATUS)
#define bfin_write_CAN0_STATUS(val) bfin_write16(CAN0_STATUS, val)
#define bfin_read_CAN0_CEC() bfin_read16(CAN0_CEC)
#define bfin_write_CAN0_CEC(val) bfin_write16(CAN0_CEC, val)
#define bfin_read_CAN0_GIS() bfin_read16(CAN0_GIS)
#define bfin_write_CAN0_GIS(val) bfin_write16(CAN0_GIS, val)
#define bfin_read_CAN0_GIM() bfin_read16(CAN0_GIM)
#define bfin_write_CAN0_GIM(val) bfin_write16(CAN0_GIM, val)
#define bfin_read_CAN0_GIF() bfin_read16(CAN0_GIF)
#define bfin_write_CAN0_GIF(val) bfin_write16(CAN0_GIF, val)
#define bfin_read_CAN0_CONTROL() bfin_read16(CAN0_CONTROL)
#define bfin_write_CAN0_CONTROL(val) bfin_write16(CAN0_CONTROL, val)
#define bfin_read_CAN0_INTR() bfin_read16(CAN0_INTR)
#define bfin_write_CAN0_INTR(val) bfin_write16(CAN0_INTR, val)
#define bfin_read_CAN0_MBTD() bfin_read16(CAN0_MBTD)
#define bfin_write_CAN0_MBTD(val) bfin_write16(CAN0_MBTD, val)
#define bfin_read_CAN0_EWR() bfin_read16(CAN0_EWR)
#define bfin_write_CAN0_EWR(val) bfin_write16(CAN0_EWR, val)
#define bfin_read_CAN0_ESR() bfin_read16(CAN0_ESR)
#define bfin_write_CAN0_ESR(val) bfin_write16(CAN0_ESR, val)
#define bfin_read_CAN0_UCCNT() bfin_read16(CAN0_UCCNT)
#define bfin_write_CAN0_UCCNT(val) bfin_write16(CAN0_UCCNT, val)
#define bfin_read_CAN0_UCRC() bfin_read16(CAN0_UCRC)
#define bfin_write_CAN0_UCRC(val) bfin_write16(CAN0_UCRC, val)
#define bfin_read_CAN0_UCCNF() bfin_read16(CAN0_UCCNF)
#define bfin_write_CAN0_UCCNF(val) bfin_write16(CAN0_UCCNF, val)
/* CAN Controller 0 Accebfin_read_()tance Registers */
#define bfin_read_CAN0_AM00L() bfin_read16(CAN0_AM00L)
#define bfin_write_CAN0_AM00L(val) bfin_write16(CAN0_AM00L, val)
#define bfin_read_CAN0_AM00H() bfin_read16(CAN0_AM00H)
#define bfin_write_CAN0_AM00H(val) bfin_write16(CAN0_AM00H, val)
#define bfin_read_CAN0_AM01L() bfin_read16(CAN0_AM01L)
#define bfin_write_CAN0_AM01L(val) bfin_write16(CAN0_AM01L, val)
#define bfin_read_CAN0_AM01H() bfin_read16(CAN0_AM01H)
#define bfin_write_CAN0_AM01H(val) bfin_write16(CAN0_AM01H, val)
#define bfin_read_CAN0_AM02L() bfin_read16(CAN0_AM02L)
#define bfin_write_CAN0_AM02L(val) bfin_write16(CAN0_AM02L, val)
#define bfin_read_CAN0_AM02H() bfin_read16(CAN0_AM02H)
#define bfin_write_CAN0_AM02H(val) bfin_write16(CAN0_AM02H, val)
#define bfin_read_CAN0_AM03L() bfin_read16(CAN0_AM03L)
#define bfin_write_CAN0_AM03L(val) bfin_write16(CAN0_AM03L, val)
#define bfin_read_CAN0_AM03H() bfin_read16(CAN0_AM03H)
#define bfin_write_CAN0_AM03H(val) bfin_write16(CAN0_AM03H, val)
#define bfin_read_CAN0_AM04L() bfin_read16(CAN0_AM04L)
#define bfin_write_CAN0_AM04L(val) bfin_write16(CAN0_AM04L, val)
#define bfin_read_CAN0_AM04H() bfin_read16(CAN0_AM04H)
#define bfin_write_CAN0_AM04H(val) bfin_write16(CAN0_AM04H, val)
#define bfin_read_CAN0_AM05L() bfin_read16(CAN0_AM05L)
#define bfin_write_CAN0_AM05L(val) bfin_write16(CAN0_AM05L, val)
#define bfin_read_CAN0_AM05H() bfin_read16(CAN0_AM05H)
#define bfin_write_CAN0_AM05H(val) bfin_write16(CAN0_AM05H, val)
#define bfin_read_CAN0_AM06L() bfin_read16(CAN0_AM06L)
#define bfin_write_CAN0_AM06L(val) bfin_write16(CAN0_AM06L, val)
#define bfin_read_CAN0_AM06H() bfin_read16(CAN0_AM06H)
#define bfin_write_CAN0_AM06H(val) bfin_write16(CAN0_AM06H, val)
#define bfin_read_CAN0_AM07L() bfin_read16(CAN0_AM07L)
#define bfin_write_CAN0_AM07L(val) bfin_write16(CAN0_AM07L, val)
#define bfin_read_CAN0_AM07H() bfin_read16(CAN0_AM07H)
#define bfin_write_CAN0_AM07H(val) bfin_write16(CAN0_AM07H, val)
#define bfin_read_CAN0_AM08L() bfin_read16(CAN0_AM08L)
#define bfin_write_CAN0_AM08L(val) bfin_write16(CAN0_AM08L, val)
#define bfin_read_CAN0_AM08H() bfin_read16(CAN0_AM08H)
#define bfin_write_CAN0_AM08H(val) bfin_write16(CAN0_AM08H, val)
#define bfin_read_CAN0_AM09L() bfin_read16(CAN0_AM09L)
#define bfin_write_CAN0_AM09L(val) bfin_write16(CAN0_AM09L, val)
#define bfin_read_CAN0_AM09H() bfin_read16(CAN0_AM09H)
#define bfin_write_CAN0_AM09H(val) bfin_write16(CAN0_AM09H, val)
#define bfin_read_CAN0_AM10L() bfin_read16(CAN0_AM10L)
#define bfin_write_CAN0_AM10L(val) bfin_write16(CAN0_AM10L, val)
#define bfin_read_CAN0_AM10H() bfin_read16(CAN0_AM10H)
#define bfin_write_CAN0_AM10H(val) bfin_write16(CAN0_AM10H, val)
#define bfin_read_CAN0_AM11L() bfin_read16(CAN0_AM11L)
#define bfin_write_CAN0_AM11L(val) bfin_write16(CAN0_AM11L, val)
#define bfin_read_CAN0_AM11H() bfin_read16(CAN0_AM11H)
#define bfin_write_CAN0_AM11H(val) bfin_write16(CAN0_AM11H, val)
#define bfin_read_CAN0_AM12L() bfin_read16(CAN0_AM12L)
#define bfin_write_CAN0_AM12L(val) bfin_write16(CAN0_AM12L, val)
#define bfin_read_CAN0_AM12H() bfin_read16(CAN0_AM12H)
#define bfin_write_CAN0_AM12H(val) bfin_write16(CAN0_AM12H, val)
#define bfin_read_CAN0_AM13L() bfin_read16(CAN0_AM13L)
#define bfin_write_CAN0_AM13L(val) bfin_write16(CAN0_AM13L, val)
#define bfin_read_CAN0_AM13H() bfin_read16(CAN0_AM13H)
#define bfin_write_CAN0_AM13H(val) bfin_write16(CAN0_AM13H, val)
#define bfin_read_CAN0_AM14L() bfin_read16(CAN0_AM14L)
#define bfin_write_CAN0_AM14L(val) bfin_write16(CAN0_AM14L, val)
#define bfin_read_CAN0_AM14H() bfin_read16(CAN0_AM14H)
#define bfin_write_CAN0_AM14H(val) bfin_write16(CAN0_AM14H, val)
#define bfin_read_CAN0_AM15L() bfin_read16(CAN0_AM15L)
#define bfin_write_CAN0_AM15L(val) bfin_write16(CAN0_AM15L, val)
#define bfin_read_CAN0_AM15H() bfin_read16(CAN0_AM15H)
#define bfin_write_CAN0_AM15H(val) bfin_write16(CAN0_AM15H, val)
/* CAN Controller 0 Accebfin_read_()tance Registers */
#define bfin_read_CAN0_AM16L() bfin_read16(CAN0_AM16L)
#define bfin_write_CAN0_AM16L(val) bfin_write16(CAN0_AM16L, val)
#define bfin_read_CAN0_AM16H() bfin_read16(CAN0_AM16H)
#define bfin_write_CAN0_AM16H(val) bfin_write16(CAN0_AM16H, val)
#define bfin_read_CAN0_AM17L() bfin_read16(CAN0_AM17L)
#define bfin_write_CAN0_AM17L(val) bfin_write16(CAN0_AM17L, val)
#define bfin_read_CAN0_AM17H() bfin_read16(CAN0_AM17H)
#define bfin_write_CAN0_AM17H(val) bfin_write16(CAN0_AM17H, val)
#define bfin_read_CAN0_AM18L() bfin_read16(CAN0_AM18L)
#define bfin_write_CAN0_AM18L(val) bfin_write16(CAN0_AM18L, val)
#define bfin_read_CAN0_AM18H() bfin_read16(CAN0_AM18H)
#define bfin_write_CAN0_AM18H(val) bfin_write16(CAN0_AM18H, val)
#define bfin_read_CAN0_AM19L() bfin_read16(CAN0_AM19L)
#define bfin_write_CAN0_AM19L(val) bfin_write16(CAN0_AM19L, val)
#define bfin_read_CAN0_AM19H() bfin_read16(CAN0_AM19H)
#define bfin_write_CAN0_AM19H(val) bfin_write16(CAN0_AM19H, val)
#define bfin_read_CAN0_AM20L() bfin_read16(CAN0_AM20L)
#define bfin_write_CAN0_AM20L(val) bfin_write16(CAN0_AM20L, val)
#define bfin_read_CAN0_AM20H() bfin_read16(CAN0_AM20H)
#define bfin_write_CAN0_AM20H(val) bfin_write16(CAN0_AM20H, val)
#define bfin_read_CAN0_AM21L() bfin_read16(CAN0_AM21L)
#define bfin_write_CAN0_AM21L(val) bfin_write16(CAN0_AM21L, val)
#define bfin_read_CAN0_AM21H() bfin_read16(CAN0_AM21H)
#define bfin_write_CAN0_AM21H(val) bfin_write16(CAN0_AM21H, val)
#define bfin_read_CAN0_AM22L() bfin_read16(CAN0_AM22L)
#define bfin_write_CAN0_AM22L(val) bfin_write16(CAN0_AM22L, val)
#define bfin_read_CAN0_AM22H() bfin_read16(CAN0_AM22H)
#define bfin_write_CAN0_AM22H(val) bfin_write16(CAN0_AM22H, val)
#define bfin_read_CAN0_AM23L() bfin_read16(CAN0_AM23L)
#define bfin_write_CAN0_AM23L(val) bfin_write16(CAN0_AM23L, val)
#define bfin_read_CAN0_AM23H() bfin_read16(CAN0_AM23H)
#define bfin_write_CAN0_AM23H(val) bfin_write16(CAN0_AM23H, val)
#define bfin_read_CAN0_AM24L() bfin_read16(CAN0_AM24L)
#define bfin_write_CAN0_AM24L(val) bfin_write16(CAN0_AM24L, val)
#define bfin_read_CAN0_AM24H() bfin_read16(CAN0_AM24H)
#define bfin_write_CAN0_AM24H(val) bfin_write16(CAN0_AM24H, val)
#define bfin_read_CAN0_AM25L() bfin_read16(CAN0_AM25L)
#define bfin_write_CAN0_AM25L(val) bfin_write16(CAN0_AM25L, val)
#define bfin_read_CAN0_AM25H() bfin_read16(CAN0_AM25H)
#define bfin_write_CAN0_AM25H(val) bfin_write16(CAN0_AM25H, val)
#define bfin_read_CAN0_AM26L() bfin_read16(CAN0_AM26L)
#define bfin_write_CAN0_AM26L(val) bfin_write16(CAN0_AM26L, val)
#define bfin_read_CAN0_AM26H() bfin_read16(CAN0_AM26H)
#define bfin_write_CAN0_AM26H(val) bfin_write16(CAN0_AM26H, val)
#define bfin_read_CAN0_AM27L() bfin_read16(CAN0_AM27L)
#define bfin_write_CAN0_AM27L(val) bfin_write16(CAN0_AM27L, val)
#define bfin_read_CAN0_AM27H() bfin_read16(CAN0_AM27H)
#define bfin_write_CAN0_AM27H(val) bfin_write16(CAN0_AM27H, val)
#define bfin_read_CAN0_AM28L() bfin_read16(CAN0_AM28L)
#define bfin_write_CAN0_AM28L(val) bfin_write16(CAN0_AM28L, val)
#define bfin_read_CAN0_AM28H() bfin_read16(CAN0_AM28H)
#define bfin_write_CAN0_AM28H(val) bfin_write16(CAN0_AM28H, val)
#define bfin_read_CAN0_AM29L() bfin_read16(CAN0_AM29L)
#define bfin_write_CAN0_AM29L(val) bfin_write16(CAN0_AM29L, val)
#define bfin_read_CAN0_AM29H() bfin_read16(CAN0_AM29H)
#define bfin_write_CAN0_AM29H(val) bfin_write16(CAN0_AM29H, val)
#define bfin_read_CAN0_AM30L() bfin_read16(CAN0_AM30L)
#define bfin_write_CAN0_AM30L(val) bfin_write16(CAN0_AM30L, val)
#define bfin_read_CAN0_AM30H() bfin_read16(CAN0_AM30H)
#define bfin_write_CAN0_AM30H(val) bfin_write16(CAN0_AM30H, val)
#define bfin_read_CAN0_AM31L() bfin_read16(CAN0_AM31L)
#define bfin_write_CAN0_AM31L(val) bfin_write16(CAN0_AM31L, val)
#define bfin_read_CAN0_AM31H() bfin_read16(CAN0_AM31H)
#define bfin_write_CAN0_AM31H(val) bfin_write16(CAN0_AM31H, val)
/* CAN Controller 0 Mailbox Data Registers */
#define bfin_read_CAN0_MB00_DATA0() bfin_read16(CAN0_MB00_DATA0)
#define bfin_write_CAN0_MB00_DATA0(val) bfin_write16(CAN0_MB00_DATA0, val)
#define bfin_read_CAN0_MB00_DATA1() bfin_read16(CAN0_MB00_DATA1)
#define bfin_write_CAN0_MB00_DATA1(val) bfin_write16(CAN0_MB00_DATA1, val)
#define bfin_read_CAN0_MB00_DATA2() bfin_read16(CAN0_MB00_DATA2)
#define bfin_write_CAN0_MB00_DATA2(val) bfin_write16(CAN0_MB00_DATA2, val)
#define bfin_read_CAN0_MB00_DATA3() bfin_read16(CAN0_MB00_DATA3)
#define bfin_write_CAN0_MB00_DATA3(val) bfin_write16(CAN0_MB00_DATA3, val)
#define bfin_read_CAN0_MB00_LENGTH() bfin_read16(CAN0_MB00_LENGTH)
#define bfin_write_CAN0_MB00_LENGTH(val) bfin_write16(CAN0_MB00_LENGTH, val)
#define bfin_read_CAN0_MB00_TIMESTAMP() bfin_read16(CAN0_MB00_TIMESTAMP)
#define bfin_write_CAN0_MB00_TIMESTAMP(val) bfin_write16(CAN0_MB00_TIMESTAMP, val)
#define bfin_read_CAN0_MB00_ID0() bfin_read16(CAN0_MB00_ID0)
#define bfin_write_CAN0_MB00_ID0(val) bfin_write16(CAN0_MB00_ID0, val)
#define bfin_read_CAN0_MB00_ID1() bfin_read16(CAN0_MB00_ID1)
#define bfin_write_CAN0_MB00_ID1(val) bfin_write16(CAN0_MB00_ID1, val)
#define bfin_read_CAN0_MB01_DATA0() bfin_read16(CAN0_MB01_DATA0)
#define bfin_write_CAN0_MB01_DATA0(val) bfin_write16(CAN0_MB01_DATA0, val)
#define bfin_read_CAN0_MB01_DATA1() bfin_read16(CAN0_MB01_DATA1)
#define bfin_write_CAN0_MB01_DATA1(val) bfin_write16(CAN0_MB01_DATA1, val)
#define bfin_read_CAN0_MB01_DATA2() bfin_read16(CAN0_MB01_DATA2)
#define bfin_write_CAN0_MB01_DATA2(val) bfin_write16(CAN0_MB01_DATA2, val)
#define bfin_read_CAN0_MB01_DATA3() bfin_read16(CAN0_MB01_DATA3)
#define bfin_write_CAN0_MB01_DATA3(val) bfin_write16(CAN0_MB01_DATA3, val)
#define bfin_read_CAN0_MB01_LENGTH() bfin_read16(CAN0_MB01_LENGTH)
#define bfin_write_CAN0_MB01_LENGTH(val) bfin_write16(CAN0_MB01_LENGTH, val)
#define bfin_read_CAN0_MB01_TIMESTAMP() bfin_read16(CAN0_MB01_TIMESTAMP)
#define bfin_write_CAN0_MB01_TIMESTAMP(val) bfin_write16(CAN0_MB01_TIMESTAMP, val)
#define bfin_read_CAN0_MB01_ID0() bfin_read16(CAN0_MB01_ID0)
#define bfin_write_CAN0_MB01_ID0(val) bfin_write16(CAN0_MB01_ID0, val)
#define bfin_read_CAN0_MB01_ID1() bfin_read16(CAN0_MB01_ID1)
#define bfin_write_CAN0_MB01_ID1(val) bfin_write16(CAN0_MB01_ID1, val)
#define bfin_read_CAN0_MB02_DATA0() bfin_read16(CAN0_MB02_DATA0)
#define bfin_write_CAN0_MB02_DATA0(val) bfin_write16(CAN0_MB02_DATA0, val)
#define bfin_read_CAN0_MB02_DATA1() bfin_read16(CAN0_MB02_DATA1)
#define bfin_write_CAN0_MB02_DATA1(val) bfin_write16(CAN0_MB02_DATA1, val)
#define bfin_read_CAN0_MB02_DATA2() bfin_read16(CAN0_MB02_DATA2)
#define bfin_write_CAN0_MB02_DATA2(val) bfin_write16(CAN0_MB02_DATA2, val)
#define bfin_read_CAN0_MB02_DATA3() bfin_read16(CAN0_MB02_DATA3)
#define bfin_write_CAN0_MB02_DATA3(val) bfin_write16(CAN0_MB02_DATA3, val)
#define bfin_read_CAN0_MB02_LENGTH() bfin_read16(CAN0_MB02_LENGTH)
#define bfin_write_CAN0_MB02_LENGTH(val) bfin_write16(CAN0_MB02_LENGTH, val)
#define bfin_read_CAN0_MB02_TIMESTAMP() bfin_read16(CAN0_MB02_TIMESTAMP)
#define bfin_write_CAN0_MB02_TIMESTAMP(val) bfin_write16(CAN0_MB02_TIMESTAMP, val)
#define bfin_read_CAN0_MB02_ID0() bfin_read16(CAN0_MB02_ID0)
#define bfin_write_CAN0_MB02_ID0(val) bfin_write16(CAN0_MB02_ID0, val)
#define bfin_read_CAN0_MB02_ID1() bfin_read16(CAN0_MB02_ID1)
#define bfin_write_CAN0_MB02_ID1(val) bfin_write16(CAN0_MB02_ID1, val)
#define bfin_read_CAN0_MB03_DATA0() bfin_read16(CAN0_MB03_DATA0)
#define bfin_write_CAN0_MB03_DATA0(val) bfin_write16(CAN0_MB03_DATA0, val)
#define bfin_read_CAN0_MB03_DATA1() bfin_read16(CAN0_MB03_DATA1)
#define bfin_write_CAN0_MB03_DATA1(val) bfin_write16(CAN0_MB03_DATA1, val)
#define bfin_read_CAN0_MB03_DATA2() bfin_read16(CAN0_MB03_DATA2)
#define bfin_write_CAN0_MB03_DATA2(val) bfin_write16(CAN0_MB03_DATA2, val)
#define bfin_read_CAN0_MB03_DATA3() bfin_read16(CAN0_MB03_DATA3)
#define bfin_write_CAN0_MB03_DATA3(val) bfin_write16(CAN0_MB03_DATA3, val)
#define bfin_read_CAN0_MB03_LENGTH() bfin_read16(CAN0_MB03_LENGTH)
#define bfin_write_CAN0_MB03_LENGTH(val) bfin_write16(CAN0_MB03_LENGTH, val)
#define bfin_read_CAN0_MB03_TIMESTAMP() bfin_read16(CAN0_MB03_TIMESTAMP)
#define bfin_write_CAN0_MB03_TIMESTAMP(val) bfin_write16(CAN0_MB03_TIMESTAMP, val)
#define bfin_read_CAN0_MB03_ID0() bfin_read16(CAN0_MB03_ID0)
#define bfin_write_CAN0_MB03_ID0(val) bfin_write16(CAN0_MB03_ID0, val)
#define bfin_read_CAN0_MB03_ID1() bfin_read16(CAN0_MB03_ID1)
#define bfin_write_CAN0_MB03_ID1(val) bfin_write16(CAN0_MB03_ID1, val)
#define bfin_read_CAN0_MB04_DATA0() bfin_read16(CAN0_MB04_DATA0)
#define bfin_write_CAN0_MB04_DATA0(val) bfin_write16(CAN0_MB04_DATA0, val)
#define bfin_read_CAN0_MB04_DATA1() bfin_read16(CAN0_MB04_DATA1)
#define bfin_write_CAN0_MB04_DATA1(val) bfin_write16(CAN0_MB04_DATA1, val)
#define bfin_read_CAN0_MB04_DATA2() bfin_read16(CAN0_MB04_DATA2)
#define bfin_write_CAN0_MB04_DATA2(val) bfin_write16(CAN0_MB04_DATA2, val)
#define bfin_read_CAN0_MB04_DATA3() bfin_read16(CAN0_MB04_DATA3)
#define bfin_write_CAN0_MB04_DATA3(val) bfin_write16(CAN0_MB04_DATA3, val)
#define bfin_read_CAN0_MB04_LENGTH() bfin_read16(CAN0_MB04_LENGTH)
#define bfin_write_CAN0_MB04_LENGTH(val) bfin_write16(CAN0_MB04_LENGTH, val)
#define bfin_read_CAN0_MB04_TIMESTAMP() bfin_read16(CAN0_MB04_TIMESTAMP)
#define bfin_write_CAN0_MB04_TIMESTAMP(val) bfin_write16(CAN0_MB04_TIMESTAMP, val)
#define bfin_read_CAN0_MB04_ID0() bfin_read16(CAN0_MB04_ID0)
#define bfin_write_CAN0_MB04_ID0(val) bfin_write16(CAN0_MB04_ID0, val)
#define bfin_read_CAN0_MB04_ID1() bfin_read16(CAN0_MB04_ID1)
#define bfin_write_CAN0_MB04_ID1(val) bfin_write16(CAN0_MB04_ID1, val)
#define bfin_read_CAN0_MB05_DATA0() bfin_read16(CAN0_MB05_DATA0)
#define bfin_write_CAN0_MB05_DATA0(val) bfin_write16(CAN0_MB05_DATA0, val)
#define bfin_read_CAN0_MB05_DATA1() bfin_read16(CAN0_MB05_DATA1)
#define bfin_write_CAN0_MB05_DATA1(val) bfin_write16(CAN0_MB05_DATA1, val)
#define bfin_read_CAN0_MB05_DATA2() bfin_read16(CAN0_MB05_DATA2)
#define bfin_write_CAN0_MB05_DATA2(val) bfin_write16(CAN0_MB05_DATA2, val)
#define bfin_read_CAN0_MB05_DATA3() bfin_read16(CAN0_MB05_DATA3)
#define bfin_write_CAN0_MB05_DATA3(val) bfin_write16(CAN0_MB05_DATA3, val)
#define bfin_read_CAN0_MB05_LENGTH() bfin_read16(CAN0_MB05_LENGTH)
#define bfin_write_CAN0_MB05_LENGTH(val) bfin_write16(CAN0_MB05_LENGTH, val)
#define bfin_read_CAN0_MB05_TIMESTAMP() bfin_read16(CAN0_MB05_TIMESTAMP)
#define bfin_write_CAN0_MB05_TIMESTAMP(val) bfin_write16(CAN0_MB05_TIMESTAMP, val)
#define bfin_read_CAN0_MB05_ID0() bfin_read16(CAN0_MB05_ID0)
#define bfin_write_CAN0_MB05_ID0(val) bfin_write16(CAN0_MB05_ID0, val)
#define bfin_read_CAN0_MB05_ID1() bfin_read16(CAN0_MB05_ID1)
#define bfin_write_CAN0_MB05_ID1(val) bfin_write16(CAN0_MB05_ID1, val)
#define bfin_read_CAN0_MB06_DATA0() bfin_read16(CAN0_MB06_DATA0)
#define bfin_write_CAN0_MB06_DATA0(val) bfin_write16(CAN0_MB06_DATA0, val)
#define bfin_read_CAN0_MB06_DATA1() bfin_read16(CAN0_MB06_DATA1)
#define bfin_write_CAN0_MB06_DATA1(val) bfin_write16(CAN0_MB06_DATA1, val)
#define bfin_read_CAN0_MB06_DATA2() bfin_read16(CAN0_MB06_DATA2)
#define bfin_write_CAN0_MB06_DATA2(val) bfin_write16(CAN0_MB06_DATA2, val)
#define bfin_read_CAN0_MB06_DATA3() bfin_read16(CAN0_MB06_DATA3)
#define bfin_write_CAN0_MB06_DATA3(val) bfin_write16(CAN0_MB06_DATA3, val)
#define bfin_read_CAN0_MB06_LENGTH() bfin_read16(CAN0_MB06_LENGTH)
#define bfin_write_CAN0_MB06_LENGTH(val) bfin_write16(CAN0_MB06_LENGTH, val)
#define bfin_read_CAN0_MB06_TIMESTAMP() bfin_read16(CAN0_MB06_TIMESTAMP)
#define bfin_write_CAN0_MB06_TIMESTAMP(val) bfin_write16(CAN0_MB06_TIMESTAMP, val)
#define bfin_read_CAN0_MB06_ID0() bfin_read16(CAN0_MB06_ID0)
#define bfin_write_CAN0_MB06_ID0(val) bfin_write16(CAN0_MB06_ID0, val)
#define bfin_read_CAN0_MB06_ID1() bfin_read16(CAN0_MB06_ID1)
#define bfin_write_CAN0_MB06_ID1(val) bfin_write16(CAN0_MB06_ID1, val)
#define bfin_read_CAN0_MB07_DATA0() bfin_read16(CAN0_MB07_DATA0)
#define bfin_write_CAN0_MB07_DATA0(val) bfin_write16(CAN0_MB07_DATA0, val)
#define bfin_read_CAN0_MB07_DATA1() bfin_read16(CAN0_MB07_DATA1)
#define bfin_write_CAN0_MB07_DATA1(val) bfin_write16(CAN0_MB07_DATA1, val)
#define bfin_read_CAN0_MB07_DATA2() bfin_read16(CAN0_MB07_DATA2)
#define bfin_write_CAN0_MB07_DATA2(val) bfin_write16(CAN0_MB07_DATA2, val)
#define bfin_read_CAN0_MB07_DATA3() bfin_read16(CAN0_MB07_DATA3)
#define bfin_write_CAN0_MB07_DATA3(val) bfin_write16(CAN0_MB07_DATA3, val)
#define bfin_read_CAN0_MB07_LENGTH() bfin_read16(CAN0_MB07_LENGTH)
#define bfin_write_CAN0_MB07_LENGTH(val) bfin_write16(CAN0_MB07_LENGTH, val)
#define bfin_read_CAN0_MB07_TIMESTAMP() bfin_read16(CAN0_MB07_TIMESTAMP)
#define bfin_write_CAN0_MB07_TIMESTAMP(val) bfin_write16(CAN0_MB07_TIMESTAMP, val)
#define bfin_read_CAN0_MB07_ID0() bfin_read16(CAN0_MB07_ID0)
#define bfin_write_CAN0_MB07_ID0(val) bfin_write16(CAN0_MB07_ID0, val)
#define bfin_read_CAN0_MB07_ID1() bfin_read16(CAN0_MB07_ID1)
#define bfin_write_CAN0_MB07_ID1(val) bfin_write16(CAN0_MB07_ID1, val)
#define bfin_read_CAN0_MB08_DATA0() bfin_read16(CAN0_MB08_DATA0)
#define bfin_write_CAN0_MB08_DATA0(val) bfin_write16(CAN0_MB08_DATA0, val)
#define bfin_read_CAN0_MB08_DATA1() bfin_read16(CAN0_MB08_DATA1)
#define bfin_write_CAN0_MB08_DATA1(val) bfin_write16(CAN0_MB08_DATA1, val)
#define bfin_read_CAN0_MB08_DATA2() bfin_read16(CAN0_MB08_DATA2)
#define bfin_write_CAN0_MB08_DATA2(val) bfin_write16(CAN0_MB08_DATA2, val)
#define bfin_read_CAN0_MB08_DATA3() bfin_read16(CAN0_MB08_DATA3)
#define bfin_write_CAN0_MB08_DATA3(val) bfin_write16(CAN0_MB08_DATA3, val)
#define bfin_read_CAN0_MB08_LENGTH() bfin_read16(CAN0_MB08_LENGTH)
#define bfin_write_CAN0_MB08_LENGTH(val) bfin_write16(CAN0_MB08_LENGTH, val)
#define bfin_read_CAN0_MB08_TIMESTAMP() bfin_read16(CAN0_MB08_TIMESTAMP)
#define bfin_write_CAN0_MB08_TIMESTAMP(val) bfin_write16(CAN0_MB08_TIMESTAMP, val)
#define bfin_read_CAN0_MB08_ID0() bfin_read16(CAN0_MB08_ID0)
#define bfin_write_CAN0_MB08_ID0(val) bfin_write16(CAN0_MB08_ID0, val)
#define bfin_read_CAN0_MB08_ID1() bfin_read16(CAN0_MB08_ID1)
#define bfin_write_CAN0_MB08_ID1(val) bfin_write16(CAN0_MB08_ID1, val)
#define bfin_read_CAN0_MB09_DATA0() bfin_read16(CAN0_MB09_DATA0)
#define bfin_write_CAN0_MB09_DATA0(val) bfin_write16(CAN0_MB09_DATA0, val)
#define bfin_read_CAN0_MB09_DATA1() bfin_read16(CAN0_MB09_DATA1)
#define bfin_write_CAN0_MB09_DATA1(val) bfin_write16(CAN0_MB09_DATA1, val)
#define bfin_read_CAN0_MB09_DATA2() bfin_read16(CAN0_MB09_DATA2)
#define bfin_write_CAN0_MB09_DATA2(val) bfin_write16(CAN0_MB09_DATA2, val)
#define bfin_read_CAN0_MB09_DATA3() bfin_read16(CAN0_MB09_DATA3)
#define bfin_write_CAN0_MB09_DATA3(val) bfin_write16(CAN0_MB09_DATA3, val)
#define bfin_read_CAN0_MB09_LENGTH() bfin_read16(CAN0_MB09_LENGTH)
#define bfin_write_CAN0_MB09_LENGTH(val) bfin_write16(CAN0_MB09_LENGTH, val)
#define bfin_read_CAN0_MB09_TIMESTAMP() bfin_read16(CAN0_MB09_TIMESTAMP)
#define bfin_write_CAN0_MB09_TIMESTAMP(val) bfin_write16(CAN0_MB09_TIMESTAMP, val)
#define bfin_read_CAN0_MB09_ID0() bfin_read16(CAN0_MB09_ID0)
#define bfin_write_CAN0_MB09_ID0(val) bfin_write16(CAN0_MB09_ID0, val)
#define bfin_read_CAN0_MB09_ID1() bfin_read16(CAN0_MB09_ID1)
#define bfin_write_CAN0_MB09_ID1(val) bfin_write16(CAN0_MB09_ID1, val)
#define bfin_read_CAN0_MB10_DATA0() bfin_read16(CAN0_MB10_DATA0)
#define bfin_write_CAN0_MB10_DATA0(val) bfin_write16(CAN0_MB10_DATA0, val)
#define bfin_read_CAN0_MB10_DATA1() bfin_read16(CAN0_MB10_DATA1)
#define bfin_write_CAN0_MB10_DATA1(val) bfin_write16(CAN0_MB10_DATA1, val)
#define bfin_read_CAN0_MB10_DATA2() bfin_read16(CAN0_MB10_DATA2)
#define bfin_write_CAN0_MB10_DATA2(val) bfin_write16(CAN0_MB10_DATA2, val)
#define bfin_read_CAN0_MB10_DATA3() bfin_read16(CAN0_MB10_DATA3)
#define bfin_write_CAN0_MB10_DATA3(val) bfin_write16(CAN0_MB10_DATA3, val)
#define bfin_read_CAN0_MB10_LENGTH() bfin_read16(CAN0_MB10_LENGTH)
#define bfin_write_CAN0_MB10_LENGTH(val) bfin_write16(CAN0_MB10_LENGTH, val)
#define bfin_read_CAN0_MB10_TIMESTAMP() bfin_read16(CAN0_MB10_TIMESTAMP)
#define bfin_write_CAN0_MB10_TIMESTAMP(val) bfin_write16(CAN0_MB10_TIMESTAMP, val)
#define bfin_read_CAN0_MB10_ID0() bfin_read16(CAN0_MB10_ID0)
#define bfin_write_CAN0_MB10_ID0(val) bfin_write16(CAN0_MB10_ID0, val)
#define bfin_read_CAN0_MB10_ID1() bfin_read16(CAN0_MB10_ID1)
#define bfin_write_CAN0_MB10_ID1(val) bfin_write16(CAN0_MB10_ID1, val)
#define bfin_read_CAN0_MB11_DATA0() bfin_read16(CAN0_MB11_DATA0)
#define bfin_write_CAN0_MB11_DATA0(val) bfin_write16(CAN0_MB11_DATA0, val)
#define bfin_read_CAN0_MB11_DATA1() bfin_read16(CAN0_MB11_DATA1)
#define bfin_write_CAN0_MB11_DATA1(val) bfin_write16(CAN0_MB11_DATA1, val)
#define bfin_read_CAN0_MB11_DATA2() bfin_read16(CAN0_MB11_DATA2)
#define bfin_write_CAN0_MB11_DATA2(val) bfin_write16(CAN0_MB11_DATA2, val)
#define bfin_read_CAN0_MB11_DATA3() bfin_read16(CAN0_MB11_DATA3)
#define bfin_write_CAN0_MB11_DATA3(val) bfin_write16(CAN0_MB11_DATA3, val)
#define bfin_read_CAN0_MB11_LENGTH() bfin_read16(CAN0_MB11_LENGTH)
#define bfin_write_CAN0_MB11_LENGTH(val) bfin_write16(CAN0_MB11_LENGTH, val)
#define bfin_read_CAN0_MB11_TIMESTAMP() bfin_read16(CAN0_MB11_TIMESTAMP)
#define bfin_write_CAN0_MB11_TIMESTAMP(val) bfin_write16(CAN0_MB11_TIMESTAMP, val)
#define bfin_read_CAN0_MB11_ID0() bfin_read16(CAN0_MB11_ID0)
#define bfin_write_CAN0_MB11_ID0(val) bfin_write16(CAN0_MB11_ID0, val)
#define bfin_read_CAN0_MB11_ID1() bfin_read16(CAN0_MB11_ID1)
#define bfin_write_CAN0_MB11_ID1(val) bfin_write16(CAN0_MB11_ID1, val)
#define bfin_read_CAN0_MB12_DATA0() bfin_read16(CAN0_MB12_DATA0)
#define bfin_write_CAN0_MB12_DATA0(val) bfin_write16(CAN0_MB12_DATA0, val)
#define bfin_read_CAN0_MB12_DATA1() bfin_read16(CAN0_MB12_DATA1)
#define bfin_write_CAN0_MB12_DATA1(val) bfin_write16(CAN0_MB12_DATA1, val)
#define bfin_read_CAN0_MB12_DATA2() bfin_read16(CAN0_MB12_DATA2)
#define bfin_write_CAN0_MB12_DATA2(val) bfin_write16(CAN0_MB12_DATA2, val)
#define bfin_read_CAN0_MB12_DATA3() bfin_read16(CAN0_MB12_DATA3)
#define bfin_write_CAN0_MB12_DATA3(val) bfin_write16(CAN0_MB12_DATA3, val)
#define bfin_read_CAN0_MB12_LENGTH() bfin_read16(CAN0_MB12_LENGTH)
#define bfin_write_CAN0_MB12_LENGTH(val) bfin_write16(CAN0_MB12_LENGTH, val)
#define bfin_read_CAN0_MB12_TIMESTAMP() bfin_read16(CAN0_MB12_TIMESTAMP)
#define bfin_write_CAN0_MB12_TIMESTAMP(val) bfin_write16(CAN0_MB12_TIMESTAMP, val)
#define bfin_read_CAN0_MB12_ID0() bfin_read16(CAN0_MB12_ID0)
#define bfin_write_CAN0_MB12_ID0(val) bfin_write16(CAN0_MB12_ID0, val)
#define bfin_read_CAN0_MB12_ID1() bfin_read16(CAN0_MB12_ID1)
#define bfin_write_CAN0_MB12_ID1(val) bfin_write16(CAN0_MB12_ID1, val)
#define bfin_read_CAN0_MB13_DATA0() bfin_read16(CAN0_MB13_DATA0)
#define bfin_write_CAN0_MB13_DATA0(val) bfin_write16(CAN0_MB13_DATA0, val)
#define bfin_read_CAN0_MB13_DATA1() bfin_read16(CAN0_MB13_DATA1)
#define bfin_write_CAN0_MB13_DATA1(val) bfin_write16(CAN0_MB13_DATA1, val)
#define bfin_read_CAN0_MB13_DATA2() bfin_read16(CAN0_MB13_DATA2)
#define bfin_write_CAN0_MB13_DATA2(val) bfin_write16(CAN0_MB13_DATA2, val)
#define bfin_read_CAN0_MB13_DATA3() bfin_read16(CAN0_MB13_DATA3)
#define bfin_write_CAN0_MB13_DATA3(val) bfin_write16(CAN0_MB13_DATA3, val)
#define bfin_read_CAN0_MB13_LENGTH() bfin_read16(CAN0_MB13_LENGTH)
#define bfin_write_CAN0_MB13_LENGTH(val) bfin_write16(CAN0_MB13_LENGTH, val)
#define bfin_read_CAN0_MB13_TIMESTAMP() bfin_read16(CAN0_MB13_TIMESTAMP)
#define bfin_write_CAN0_MB13_TIMESTAMP(val) bfin_write16(CAN0_MB13_TIMESTAMP, val)
#define bfin_read_CAN0_MB13_ID0() bfin_read16(CAN0_MB13_ID0)
#define bfin_write_CAN0_MB13_ID0(val) bfin_write16(CAN0_MB13_ID0, val)
#define bfin_read_CAN0_MB13_ID1() bfin_read16(CAN0_MB13_ID1)
#define bfin_write_CAN0_MB13_ID1(val) bfin_write16(CAN0_MB13_ID1, val)
#define bfin_read_CAN0_MB14_DATA0() bfin_read16(CAN0_MB14_DATA0)
#define bfin_write_CAN0_MB14_DATA0(val) bfin_write16(CAN0_MB14_DATA0, val)
#define bfin_read_CAN0_MB14_DATA1() bfin_read16(CAN0_MB14_DATA1)
#define bfin_write_CAN0_MB14_DATA1(val) bfin_write16(CAN0_MB14_DATA1, val)
#define bfin_read_CAN0_MB14_DATA2() bfin_read16(CAN0_MB14_DATA2)
#define bfin_write_CAN0_MB14_DATA2(val) bfin_write16(CAN0_MB14_DATA2, val)
#define bfin_read_CAN0_MB14_DATA3() bfin_read16(CAN0_MB14_DATA3)
#define bfin_write_CAN0_MB14_DATA3(val) bfin_write16(CAN0_MB14_DATA3, val)
#define bfin_read_CAN0_MB14_LENGTH() bfin_read16(CAN0_MB14_LENGTH)
#define bfin_write_CAN0_MB14_LENGTH(val) bfin_write16(CAN0_MB14_LENGTH, val)
#define bfin_read_CAN0_MB14_TIMESTAMP() bfin_read16(CAN0_MB14_TIMESTAMP)
#define bfin_write_CAN0_MB14_TIMESTAMP(val) bfin_write16(CAN0_MB14_TIMESTAMP, val)
#define bfin_read_CAN0_MB14_ID0() bfin_read16(CAN0_MB14_ID0)
#define bfin_write_CAN0_MB14_ID0(val) bfin_write16(CAN0_MB14_ID0, val)
#define bfin_read_CAN0_MB14_ID1() bfin_read16(CAN0_MB14_ID1)
#define bfin_write_CAN0_MB14_ID1(val) bfin_write16(CAN0_MB14_ID1, val)
#define bfin_read_CAN0_MB15_DATA0() bfin_read16(CAN0_MB15_DATA0)
#define bfin_write_CAN0_MB15_DATA0(val) bfin_write16(CAN0_MB15_DATA0, val)
#define bfin_read_CAN0_MB15_DATA1() bfin_read16(CAN0_MB15_DATA1)
#define bfin_write_CAN0_MB15_DATA1(val) bfin_write16(CAN0_MB15_DATA1, val)
#define bfin_read_CAN0_MB15_DATA2() bfin_read16(CAN0_MB15_DATA2)
#define bfin_write_CAN0_MB15_DATA2(val) bfin_write16(CAN0_MB15_DATA2, val)
#define bfin_read_CAN0_MB15_DATA3() bfin_read16(CAN0_MB15_DATA3)
#define bfin_write_CAN0_MB15_DATA3(val) bfin_write16(CAN0_MB15_DATA3, val)
#define bfin_read_CAN0_MB15_LENGTH() bfin_read16(CAN0_MB15_LENGTH)
#define bfin_write_CAN0_MB15_LENGTH(val) bfin_write16(CAN0_MB15_LENGTH, val)
#define bfin_read_CAN0_MB15_TIMESTAMP() bfin_read16(CAN0_MB15_TIMESTAMP)
#define bfin_write_CAN0_MB15_TIMESTAMP(val) bfin_write16(CAN0_MB15_TIMESTAMP, val)
#define bfin_read_CAN0_MB15_ID0() bfin_read16(CAN0_MB15_ID0)
#define bfin_write_CAN0_MB15_ID0(val) bfin_write16(CAN0_MB15_ID0, val)
#define bfin_read_CAN0_MB15_ID1() bfin_read16(CAN0_MB15_ID1)
#define bfin_write_CAN0_MB15_ID1(val) bfin_write16(CAN0_MB15_ID1, val)
/* CAN Controller 0 Mailbox Data Registers */
#define bfin_read_CAN0_MB16_DATA0() bfin_read16(CAN0_MB16_DATA0)
#define bfin_write_CAN0_MB16_DATA0(val) bfin_write16(CAN0_MB16_DATA0, val)
#define bfin_read_CAN0_MB16_DATA1() bfin_read16(CAN0_MB16_DATA1)
#define bfin_write_CAN0_MB16_DATA1(val) bfin_write16(CAN0_MB16_DATA1, val)
#define bfin_read_CAN0_MB16_DATA2() bfin_read16(CAN0_MB16_DATA2)
#define bfin_write_CAN0_MB16_DATA2(val) bfin_write16(CAN0_MB16_DATA2, val)
#define bfin_read_CAN0_MB16_DATA3() bfin_read16(CAN0_MB16_DATA3)
#define bfin_write_CAN0_MB16_DATA3(val) bfin_write16(CAN0_MB16_DATA3, val)
#define bfin_read_CAN0_MB16_LENGTH() bfin_read16(CAN0_MB16_LENGTH)
#define bfin_write_CAN0_MB16_LENGTH(val) bfin_write16(CAN0_MB16_LENGTH, val)
#define bfin_read_CAN0_MB16_TIMESTAMP() bfin_read16(CAN0_MB16_TIMESTAMP)
#define bfin_write_CAN0_MB16_TIMESTAMP(val) bfin_write16(CAN0_MB16_TIMESTAMP, val)
#define bfin_read_CAN0_MB16_ID0() bfin_read16(CAN0_MB16_ID0)
#define bfin_write_CAN0_MB16_ID0(val) bfin_write16(CAN0_MB16_ID0, val)
#define bfin_read_CAN0_MB16_ID1() bfin_read16(CAN0_MB16_ID1)
#define bfin_write_CAN0_MB16_ID1(val) bfin_write16(CAN0_MB16_ID1, val)
#define bfin_read_CAN0_MB17_DATA0() bfin_read16(CAN0_MB17_DATA0)
#define bfin_write_CAN0_MB17_DATA0(val) bfin_write16(CAN0_MB17_DATA0, val)
#define bfin_read_CAN0_MB17_DATA1() bfin_read16(CAN0_MB17_DATA1)
#define bfin_write_CAN0_MB17_DATA1(val) bfin_write16(CAN0_MB17_DATA1, val)
#define bfin_read_CAN0_MB17_DATA2() bfin_read16(CAN0_MB17_DATA2)
#define bfin_write_CAN0_MB17_DATA2(val) bfin_write16(CAN0_MB17_DATA2, val)
#define bfin_read_CAN0_MB17_DATA3() bfin_read16(CAN0_MB17_DATA3)
#define bfin_write_CAN0_MB17_DATA3(val) bfin_write16(CAN0_MB17_DATA3, val)
#define bfin_read_CAN0_MB17_LENGTH() bfin_read16(CAN0_MB17_LENGTH)
#define bfin_write_CAN0_MB17_LENGTH(val) bfin_write16(CAN0_MB17_LENGTH, val)
#define bfin_read_CAN0_MB17_TIMESTAMP() bfin_read16(CAN0_MB17_TIMESTAMP)
#define bfin_write_CAN0_MB17_TIMESTAMP(val) bfin_write16(CAN0_MB17_TIMESTAMP, val)
#define bfin_read_CAN0_MB17_ID0() bfin_read16(CAN0_MB17_ID0)
#define bfin_write_CAN0_MB17_ID0(val) bfin_write16(CAN0_MB17_ID0, val)
#define bfin_read_CAN0_MB17_ID1() bfin_read16(CAN0_MB17_ID1)
#define bfin_write_CAN0_MB17_ID1(val) bfin_write16(CAN0_MB17_ID1, val)
#define bfin_read_CAN0_MB18_DATA0() bfin_read16(CAN0_MB18_DATA0)
#define bfin_write_CAN0_MB18_DATA0(val) bfin_write16(CAN0_MB18_DATA0, val)
#define bfin_read_CAN0_MB18_DATA1() bfin_read16(CAN0_MB18_DATA1)
#define bfin_write_CAN0_MB18_DATA1(val) bfin_write16(CAN0_MB18_DATA1, val)
#define bfin_read_CAN0_MB18_DATA2() bfin_read16(CAN0_MB18_DATA2)
#define bfin_write_CAN0_MB18_DATA2(val) bfin_write16(CAN0_MB18_DATA2, val)
#define bfin_read_CAN0_MB18_DATA3() bfin_read16(CAN0_MB18_DATA3)
#define bfin_write_CAN0_MB18_DATA3(val) bfin_write16(CAN0_MB18_DATA3, val)
#define bfin_read_CAN0_MB18_LENGTH() bfin_read16(CAN0_MB18_LENGTH)
#define bfin_write_CAN0_MB18_LENGTH(val) bfin_write16(CAN0_MB18_LENGTH, val)
#define bfin_read_CAN0_MB18_TIMESTAMP() bfin_read16(CAN0_MB18_TIMESTAMP)
#define bfin_write_CAN0_MB18_TIMESTAMP(val) bfin_write16(CAN0_MB18_TIMESTAMP, val)
#define bfin_read_CAN0_MB18_ID0() bfin_read16(CAN0_MB18_ID0)
#define bfin_write_CAN0_MB18_ID0(val) bfin_write16(CAN0_MB18_ID0, val)
#define bfin_read_CAN0_MB18_ID1() bfin_read16(CAN0_MB18_ID1)
#define bfin_write_CAN0_MB18_ID1(val) bfin_write16(CAN0_MB18_ID1, val)
#define bfin_read_CAN0_MB19_DATA0() bfin_read16(CAN0_MB19_DATA0)
#define bfin_write_CAN0_MB19_DATA0(val) bfin_write16(CAN0_MB19_DATA0, val)
#define bfin_read_CAN0_MB19_DATA1() bfin_read16(CAN0_MB19_DATA1)
#define bfin_write_CAN0_MB19_DATA1(val) bfin_write16(CAN0_MB19_DATA1, val)
#define bfin_read_CAN0_MB19_DATA2() bfin_read16(CAN0_MB19_DATA2)
#define bfin_write_CAN0_MB19_DATA2(val) bfin_write16(CAN0_MB19_DATA2, val)
#define bfin_read_CAN0_MB19_DATA3() bfin_read16(CAN0_MB19_DATA3)
#define bfin_write_CAN0_MB19_DATA3(val) bfin_write16(CAN0_MB19_DATA3, val)
#define bfin_read_CAN0_MB19_LENGTH() bfin_read16(CAN0_MB19_LENGTH)
#define bfin_write_CAN0_MB19_LENGTH(val) bfin_write16(CAN0_MB19_LENGTH, val)
#define bfin_read_CAN0_MB19_TIMESTAMP() bfin_read16(CAN0_MB19_TIMESTAMP)
#define bfin_write_CAN0_MB19_TIMESTAMP(val) bfin_write16(CAN0_MB19_TIMESTAMP, val)
#define bfin_read_CAN0_MB19_ID0() bfin_read16(CAN0_MB19_ID0)
#define bfin_write_CAN0_MB19_ID0(val) bfin_write16(CAN0_MB19_ID0, val)
#define bfin_read_CAN0_MB19_ID1() bfin_read16(CAN0_MB19_ID1)
#define bfin_write_CAN0_MB19_ID1(val) bfin_write16(CAN0_MB19_ID1, val)
#define bfin_read_CAN0_MB20_DATA0() bfin_read16(CAN0_MB20_DATA0)
#define bfin_write_CAN0_MB20_DATA0(val) bfin_write16(CAN0_MB20_DATA0, val)
#define bfin_read_CAN0_MB20_DATA1() bfin_read16(CAN0_MB20_DATA1)
#define bfin_write_CAN0_MB20_DATA1(val) bfin_write16(CAN0_MB20_DATA1, val)
#define bfin_read_CAN0_MB20_DATA2() bfin_read16(CAN0_MB20_DATA2)
#define bfin_write_CAN0_MB20_DATA2(val) bfin_write16(CAN0_MB20_DATA2, val)
#define bfin_read_CAN0_MB20_DATA3() bfin_read16(CAN0_MB20_DATA3)
#define bfin_write_CAN0_MB20_DATA3(val) bfin_write16(CAN0_MB20_DATA3, val)
#define bfin_read_CAN0_MB20_LENGTH() bfin_read16(CAN0_MB20_LENGTH)
#define bfin_write_CAN0_MB20_LENGTH(val) bfin_write16(CAN0_MB20_LENGTH, val)
#define bfin_read_CAN0_MB20_TIMESTAMP() bfin_read16(CAN0_MB20_TIMESTAMP)
#define bfin_write_CAN0_MB20_TIMESTAMP(val) bfin_write16(CAN0_MB20_TIMESTAMP, val)
#define bfin_read_CAN0_MB20_ID0() bfin_read16(CAN0_MB20_ID0)
#define bfin_write_CAN0_MB20_ID0(val) bfin_write16(CAN0_MB20_ID0, val)
#define bfin_read_CAN0_MB20_ID1() bfin_read16(CAN0_MB20_ID1)
#define bfin_write_CAN0_MB20_ID1(val) bfin_write16(CAN0_MB20_ID1, val)
#define bfin_read_CAN0_MB21_DATA0() bfin_read16(CAN0_MB21_DATA0)
#define bfin_write_CAN0_MB21_DATA0(val) bfin_write16(CAN0_MB21_DATA0, val)
#define bfin_read_CAN0_MB21_DATA1() bfin_read16(CAN0_MB21_DATA1)
#define bfin_write_CAN0_MB21_DATA1(val) bfin_write16(CAN0_MB21_DATA1, val)
#define bfin_read_CAN0_MB21_DATA2() bfin_read16(CAN0_MB21_DATA2)
#define bfin_write_CAN0_MB21_DATA2(val) bfin_write16(CAN0_MB21_DATA2, val)
#define bfin_read_CAN0_MB21_DATA3() bfin_read16(CAN0_MB21_DATA3)
#define bfin_write_CAN0_MB21_DATA3(val) bfin_write16(CAN0_MB21_DATA3, val)
#define bfin_read_CAN0_MB21_LENGTH() bfin_read16(CAN0_MB21_LENGTH)
#define bfin_write_CAN0_MB21_LENGTH(val) bfin_write16(CAN0_MB21_LENGTH, val)
#define bfin_read_CAN0_MB21_TIMESTAMP() bfin_read16(CAN0_MB21_TIMESTAMP)
#define bfin_write_CAN0_MB21_TIMESTAMP(val) bfin_write16(CAN0_MB21_TIMESTAMP, val)
#define bfin_read_CAN0_MB21_ID0() bfin_read16(CAN0_MB21_ID0)
#define bfin_write_CAN0_MB21_ID0(val) bfin_write16(CAN0_MB21_ID0, val)
#define bfin_read_CAN0_MB21_ID1() bfin_read16(CAN0_MB21_ID1)
#define bfin_write_CAN0_MB21_ID1(val) bfin_write16(CAN0_MB21_ID1, val)
#define bfin_read_CAN0_MB22_DATA0() bfin_read16(CAN0_MB22_DATA0)
#define bfin_write_CAN0_MB22_DATA0(val) bfin_write16(CAN0_MB22_DATA0, val)
#define bfin_read_CAN0_MB22_DATA1() bfin_read16(CAN0_MB22_DATA1)
#define bfin_write_CAN0_MB22_DATA1(val) bfin_write16(CAN0_MB22_DATA1, val)
#define bfin_read_CAN0_MB22_DATA2() bfin_read16(CAN0_MB22_DATA2)
#define bfin_write_CAN0_MB22_DATA2(val) bfin_write16(CAN0_MB22_DATA2, val)
#define bfin_read_CAN0_MB22_DATA3() bfin_read16(CAN0_MB22_DATA3)
#define bfin_write_CAN0_MB22_DATA3(val) bfin_write16(CAN0_MB22_DATA3, val)
#define bfin_read_CAN0_MB22_LENGTH() bfin_read16(CAN0_MB22_LENGTH)
#define bfin_write_CAN0_MB22_LENGTH(val) bfin_write16(CAN0_MB22_LENGTH, val)
#define bfin_read_CAN0_MB22_TIMESTAMP() bfin_read16(CAN0_MB22_TIMESTAMP)
#define bfin_write_CAN0_MB22_TIMESTAMP(val) bfin_write16(CAN0_MB22_TIMESTAMP, val)
#define bfin_read_CAN0_MB22_ID0() bfin_read16(CAN0_MB22_ID0)
#define bfin_write_CAN0_MB22_ID0(val) bfin_write16(CAN0_MB22_ID0, val)
#define bfin_read_CAN0_MB22_ID1() bfin_read16(CAN0_MB22_ID1)
#define bfin_write_CAN0_MB22_ID1(val) bfin_write16(CAN0_MB22_ID1, val)
#define bfin_read_CAN0_MB23_DATA0() bfin_read16(CAN0_MB23_DATA0)
#define bfin_write_CAN0_MB23_DATA0(val) bfin_write16(CAN0_MB23_DATA0, val)
#define bfin_read_CAN0_MB23_DATA1() bfin_read16(CAN0_MB23_DATA1)
#define bfin_write_CAN0_MB23_DATA1(val) bfin_write16(CAN0_MB23_DATA1, val)
#define bfin_read_CAN0_MB23_DATA2() bfin_read16(CAN0_MB23_DATA2)
#define bfin_write_CAN0_MB23_DATA2(val) bfin_write16(CAN0_MB23_DATA2, val)
#define bfin_read_CAN0_MB23_DATA3() bfin_read16(CAN0_MB23_DATA3)
#define bfin_write_CAN0_MB23_DATA3(val) bfin_write16(CAN0_MB23_DATA3, val)
#define bfin_read_CAN0_MB23_LENGTH() bfin_read16(CAN0_MB23_LENGTH)
#define bfin_write_CAN0_MB23_LENGTH(val) bfin_write16(CAN0_MB23_LENGTH, val)
#define bfin_read_CAN0_MB23_TIMESTAMP() bfin_read16(CAN0_MB23_TIMESTAMP)
#define bfin_write_CAN0_MB23_TIMESTAMP(val) bfin_write16(CAN0_MB23_TIMESTAMP, val)
#define bfin_read_CAN0_MB23_ID0() bfin_read16(CAN0_MB23_ID0)
#define bfin_write_CAN0_MB23_ID0(val) bfin_write16(CAN0_MB23_ID0, val)
#define bfin_read_CAN0_MB23_ID1() bfin_read16(CAN0_MB23_ID1)
#define bfin_write_CAN0_MB23_ID1(val) bfin_write16(CAN0_MB23_ID1, val)
#define bfin_read_CAN0_MB24_DATA0() bfin_read16(CAN0_MB24_DATA0)
#define bfin_write_CAN0_MB24_DATA0(val) bfin_write16(CAN0_MB24_DATA0, val)
#define bfin_read_CAN0_MB24_DATA1() bfin_read16(CAN0_MB24_DATA1)
#define bfin_write_CAN0_MB24_DATA1(val) bfin_write16(CAN0_MB24_DATA1, val)
#define bfin_read_CAN0_MB24_DATA2() bfin_read16(CAN0_MB24_DATA2)
#define bfin_write_CAN0_MB24_DATA2(val) bfin_write16(CAN0_MB24_DATA2, val)
#define bfin_read_CAN0_MB24_DATA3() bfin_read16(CAN0_MB24_DATA3)
#define bfin_write_CAN0_MB24_DATA3(val) bfin_write16(CAN0_MB24_DATA3, val)
#define bfin_read_CAN0_MB24_LENGTH() bfin_read16(CAN0_MB24_LENGTH)
#define bfin_write_CAN0_MB24_LENGTH(val) bfin_write16(CAN0_MB24_LENGTH, val)
#define bfin_read_CAN0_MB24_TIMESTAMP() bfin_read16(CAN0_MB24_TIMESTAMP)
#define bfin_write_CAN0_MB24_TIMESTAMP(val) bfin_write16(CAN0_MB24_TIMESTAMP, val)
#define bfin_read_CAN0_MB24_ID0() bfin_read16(CAN0_MB24_ID0)
#define bfin_write_CAN0_MB24_ID0(val) bfin_write16(CAN0_MB24_ID0, val)
#define bfin_read_CAN0_MB24_ID1() bfin_read16(CAN0_MB24_ID1)
#define bfin_write_CAN0_MB24_ID1(val) bfin_write16(CAN0_MB24_ID1, val)
#define bfin_read_CAN0_MB25_DATA0() bfin_read16(CAN0_MB25_DATA0)
#define bfin_write_CAN0_MB25_DATA0(val) bfin_write16(CAN0_MB25_DATA0, val)
#define bfin_read_CAN0_MB25_DATA1() bfin_read16(CAN0_MB25_DATA1)
#define bfin_write_CAN0_MB25_DATA1(val) bfin_write16(CAN0_MB25_DATA1, val)
#define bfin_read_CAN0_MB25_DATA2() bfin_read16(CAN0_MB25_DATA2)
#define bfin_write_CAN0_MB25_DATA2(val) bfin_write16(CAN0_MB25_DATA2, val)
#define bfin_read_CAN0_MB25_DATA3() bfin_read16(CAN0_MB25_DATA3)
#define bfin_write_CAN0_MB25_DATA3(val) bfin_write16(CAN0_MB25_DATA3, val)
#define bfin_read_CAN0_MB25_LENGTH() bfin_read16(CAN0_MB25_LENGTH)
#define bfin_write_CAN0_MB25_LENGTH(val) bfin_write16(CAN0_MB25_LENGTH, val)
#define bfin_read_CAN0_MB25_TIMESTAMP() bfin_read16(CAN0_MB25_TIMESTAMP)
#define bfin_write_CAN0_MB25_TIMESTAMP(val) bfin_write16(CAN0_MB25_TIMESTAMP, val)
#define bfin_read_CAN0_MB25_ID0() bfin_read16(CAN0_MB25_ID0)
#define bfin_write_CAN0_MB25_ID0(val) bfin_write16(CAN0_MB25_ID0, val)
#define bfin_read_CAN0_MB25_ID1() bfin_read16(CAN0_MB25_ID1)
#define bfin_write_CAN0_MB25_ID1(val) bfin_write16(CAN0_MB25_ID1, val)
#define bfin_read_CAN0_MB26_DATA0() bfin_read16(CAN0_MB26_DATA0)
#define bfin_write_CAN0_MB26_DATA0(val) bfin_write16(CAN0_MB26_DATA0, val)
#define bfin_read_CAN0_MB26_DATA1() bfin_read16(CAN0_MB26_DATA1)
#define bfin_write_CAN0_MB26_DATA1(val) bfin_write16(CAN0_MB26_DATA1, val)
#define bfin_read_CAN0_MB26_DATA2() bfin_read16(CAN0_MB26_DATA2)
#define bfin_write_CAN0_MB26_DATA2(val) bfin_write16(CAN0_MB26_DATA2, val)
#define bfin_read_CAN0_MB26_DATA3() bfin_read16(CAN0_MB26_DATA3)
#define bfin_write_CAN0_MB26_DATA3(val) bfin_write16(CAN0_MB26_DATA3, val)
#define bfin_read_CAN0_MB26_LENGTH() bfin_read16(CAN0_MB26_LENGTH)
#define bfin_write_CAN0_MB26_LENGTH(val) bfin_write16(CAN0_MB26_LENGTH, val)
#define bfin_read_CAN0_MB26_TIMESTAMP() bfin_read16(CAN0_MB26_TIMESTAMP)
#define bfin_write_CAN0_MB26_TIMESTAMP(val) bfin_write16(CAN0_MB26_TIMESTAMP, val)
#define bfin_read_CAN0_MB26_ID0() bfin_read16(CAN0_MB26_ID0)
#define bfin_write_CAN0_MB26_ID0(val) bfin_write16(CAN0_MB26_ID0, val)
#define bfin_read_CAN0_MB26_ID1() bfin_read16(CAN0_MB26_ID1)
#define bfin_write_CAN0_MB26_ID1(val) bfin_write16(CAN0_MB26_ID1, val)
#define bfin_read_CAN0_MB27_DATA0() bfin_read16(CAN0_MB27_DATA0)
#define bfin_write_CAN0_MB27_DATA0(val) bfin_write16(CAN0_MB27_DATA0, val)
#define bfin_read_CAN0_MB27_DATA1() bfin_read16(CAN0_MB27_DATA1)
#define bfin_write_CAN0_MB27_DATA1(val) bfin_write16(CAN0_MB27_DATA1, val)
#define bfin_read_CAN0_MB27_DATA2() bfin_read16(CAN0_MB27_DATA2)
#define bfin_write_CAN0_MB27_DATA2(val) bfin_write16(CAN0_MB27_DATA2, val)
#define bfin_read_CAN0_MB27_DATA3() bfin_read16(CAN0_MB27_DATA3)
#define bfin_write_CAN0_MB27_DATA3(val) bfin_write16(CAN0_MB27_DATA3, val)
#define bfin_read_CAN0_MB27_LENGTH() bfin_read16(CAN0_MB27_LENGTH)
#define bfin_write_CAN0_MB27_LENGTH(val) bfin_write16(CAN0_MB27_LENGTH, val)
#define bfin_read_CAN0_MB27_TIMESTAMP() bfin_read16(CAN0_MB27_TIMESTAMP)
#define bfin_write_CAN0_MB27_TIMESTAMP(val) bfin_write16(CAN0_MB27_TIMESTAMP, val)
#define bfin_read_CAN0_MB27_ID0() bfin_read16(CAN0_MB27_ID0)
#define bfin_write_CAN0_MB27_ID0(val) bfin_write16(CAN0_MB27_ID0, val)
#define bfin_read_CAN0_MB27_ID1() bfin_read16(CAN0_MB27_ID1)
#define bfin_write_CAN0_MB27_ID1(val) bfin_write16(CAN0_MB27_ID1, val)
#define bfin_read_CAN0_MB28_DATA0() bfin_read16(CAN0_MB28_DATA0)
#define bfin_write_CAN0_MB28_DATA0(val) bfin_write16(CAN0_MB28_DATA0, val)
#define bfin_read_CAN0_MB28_DATA1() bfin_read16(CAN0_MB28_DATA1)
#define bfin_write_CAN0_MB28_DATA1(val) bfin_write16(CAN0_MB28_DATA1, val)
#define bfin_read_CAN0_MB28_DATA2() bfin_read16(CAN0_MB28_DATA2)
#define bfin_write_CAN0_MB28_DATA2(val) bfin_write16(CAN0_MB28_DATA2, val)
#define bfin_read_CAN0_MB28_DATA3() bfin_read16(CAN0_MB28_DATA3)
#define bfin_write_CAN0_MB28_DATA3(val) bfin_write16(CAN0_MB28_DATA3, val)
#define bfin_read_CAN0_MB28_LENGTH() bfin_read16(CAN0_MB28_LENGTH)
#define bfin_write_CAN0_MB28_LENGTH(val) bfin_write16(CAN0_MB28_LENGTH, val)
#define bfin_read_CAN0_MB28_TIMESTAMP() bfin_read16(CAN0_MB28_TIMESTAMP)
#define bfin_write_CAN0_MB28_TIMESTAMP(val) bfin_write16(CAN0_MB28_TIMESTAMP, val)
#define bfin_read_CAN0_MB28_ID0() bfin_read16(CAN0_MB28_ID0)
#define bfin_write_CAN0_MB28_ID0(val) bfin_write16(CAN0_MB28_ID0, val)
#define bfin_read_CAN0_MB28_ID1() bfin_read16(CAN0_MB28_ID1)
#define bfin_write_CAN0_MB28_ID1(val) bfin_write16(CAN0_MB28_ID1, val)
#define bfin_read_CAN0_MB29_DATA0() bfin_read16(CAN0_MB29_DATA0)
#define bfin_write_CAN0_MB29_DATA0(val) bfin_write16(CAN0_MB29_DATA0, val)
#define bfin_read_CAN0_MB29_DATA1() bfin_read16(CAN0_MB29_DATA1)
#define bfin_write_CAN0_MB29_DATA1(val) bfin_write16(CAN0_MB29_DATA1, val)
#define bfin_read_CAN0_MB29_DATA2() bfin_read16(CAN0_MB29_DATA2)
#define bfin_write_CAN0_MB29_DATA2(val) bfin_write16(CAN0_MB29_DATA2, val)
#define bfin_read_CAN0_MB29_DATA3() bfin_read16(CAN0_MB29_DATA3)
#define bfin_write_CAN0_MB29_DATA3(val) bfin_write16(CAN0_MB29_DATA3, val)
#define bfin_read_CAN0_MB29_LENGTH() bfin_read16(CAN0_MB29_LENGTH)
#define bfin_write_CAN0_MB29_LENGTH(val) bfin_write16(CAN0_MB29_LENGTH, val)
#define bfin_read_CAN0_MB29_TIMESTAMP() bfin_read16(CAN0_MB29_TIMESTAMP)
#define bfin_write_CAN0_MB29_TIMESTAMP(val) bfin_write16(CAN0_MB29_TIMESTAMP, val)
#define bfin_read_CAN0_MB29_ID0() bfin_read16(CAN0_MB29_ID0)
#define bfin_write_CAN0_MB29_ID0(val) bfin_write16(CAN0_MB29_ID0, val)
#define bfin_read_CAN0_MB29_ID1() bfin_read16(CAN0_MB29_ID1)
#define bfin_write_CAN0_MB29_ID1(val) bfin_write16(CAN0_MB29_ID1, val)
#define bfin_read_CAN0_MB30_DATA0() bfin_read16(CAN0_MB30_DATA0)
#define bfin_write_CAN0_MB30_DATA0(val) bfin_write16(CAN0_MB30_DATA0, val)
#define bfin_read_CAN0_MB30_DATA1() bfin_read16(CAN0_MB30_DATA1)
#define bfin_write_CAN0_MB30_DATA1(val) bfin_write16(CAN0_MB30_DATA1, val)
#define bfin_read_CAN0_MB30_DATA2() bfin_read16(CAN0_MB30_DATA2)
#define bfin_write_CAN0_MB30_DATA2(val) bfin_write16(CAN0_MB30_DATA2, val)
#define bfin_read_CAN0_MB30_DATA3() bfin_read16(CAN0_MB30_DATA3)
#define bfin_write_CAN0_MB30_DATA3(val) bfin_write16(CAN0_MB30_DATA3, val)
#define bfin_read_CAN0_MB30_LENGTH() bfin_read16(CAN0_MB30_LENGTH)
#define bfin_write_CAN0_MB30_LENGTH(val) bfin_write16(CAN0_MB30_LENGTH, val)
#define bfin_read_CAN0_MB30_TIMESTAMP() bfin_read16(CAN0_MB30_TIMESTAMP)
#define bfin_write_CAN0_MB30_TIMESTAMP(val) bfin_write16(CAN0_MB30_TIMESTAMP, val)
#define bfin_read_CAN0_MB30_ID0() bfin_read16(CAN0_MB30_ID0)
#define bfin_write_CAN0_MB30_ID0(val) bfin_write16(CAN0_MB30_ID0, val)
#define bfin_read_CAN0_MB30_ID1() bfin_read16(CAN0_MB30_ID1)
#define bfin_write_CAN0_MB30_ID1(val) bfin_write16(CAN0_MB30_ID1, val)
#define bfin_read_CAN0_MB31_DATA0() bfin_read16(CAN0_MB31_DATA0)
#define bfin_write_CAN0_MB31_DATA0(val) bfin_write16(CAN0_MB31_DATA0, val)
#define bfin_read_CAN0_MB31_DATA1() bfin_read16(CAN0_MB31_DATA1)
#define bfin_write_CAN0_MB31_DATA1(val) bfin_write16(CAN0_MB31_DATA1, val)
#define bfin_read_CAN0_MB31_DATA2() bfin_read16(CAN0_MB31_DATA2)
#define bfin_write_CAN0_MB31_DATA2(val) bfin_write16(CAN0_MB31_DATA2, val)
#define bfin_read_CAN0_MB31_DATA3() bfin_read16(CAN0_MB31_DATA3)
#define bfin_write_CAN0_MB31_DATA3(val) bfin_write16(CAN0_MB31_DATA3, val)
#define bfin_read_CAN0_MB31_LENGTH() bfin_read16(CAN0_MB31_LENGTH)
#define bfin_write_CAN0_MB31_LENGTH(val) bfin_write16(CAN0_MB31_LENGTH, val)
#define bfin_read_CAN0_MB31_TIMESTAMP() bfin_read16(CAN0_MB31_TIMESTAMP)
#define bfin_write_CAN0_MB31_TIMESTAMP(val) bfin_write16(CAN0_MB31_TIMESTAMP, val)
#define bfin_read_CAN0_MB31_ID0() bfin_read16(CAN0_MB31_ID0)
#define bfin_write_CAN0_MB31_ID0(val) bfin_write16(CAN0_MB31_ID0, val)
#define bfin_read_CAN0_MB31_ID1() bfin_read16(CAN0_MB31_ID1)
#define bfin_write_CAN0_MB31_ID1(val) bfin_write16(CAN0_MB31_ID1, val)
/* UART3 Registers */
#define bfin_read_UART3_DLL() bfin_read16(UART3_DLL)
#define bfin_write_UART3_DLL(val) bfin_write16(UART3_DLL, val)
#define bfin_read_UART3_DLH() bfin_read16(UART3_DLH)
#define bfin_write_UART3_DLH(val) bfin_write16(UART3_DLH, val)
#define bfin_read_UART3_GCTL() bfin_read16(UART3_GCTL)
#define bfin_write_UART3_GCTL(val) bfin_write16(UART3_GCTL, val)
#define bfin_read_UART3_LCR() bfin_read16(UART3_LCR)
#define bfin_write_UART3_LCR(val) bfin_write16(UART3_LCR, val)
#define bfin_read_UART3_MCR() bfin_read16(UART3_MCR)
#define bfin_write_UART3_MCR(val) bfin_write16(UART3_MCR, val)
#define bfin_read_UART3_LSR() bfin_read16(UART3_LSR)
#define bfin_write_UART3_LSR(val) bfin_write16(UART3_LSR, val)
#define bfin_read_UART3_MSR() bfin_read16(UART3_MSR)
#define bfin_write_UART3_MSR(val) bfin_write16(UART3_MSR, val)
#define bfin_read_UART3_SCR() bfin_read16(UART3_SCR)
#define bfin_write_UART3_SCR(val) bfin_write16(UART3_SCR, val)
#define bfin_read_UART3_IER_SET() bfin_read16(UART3_IER_SET)
#define bfin_write_UART3_IER_SET(val) bfin_write16(UART3_IER_SET, val)
#define bfin_read_UART3_IER_CLEAR() bfin_read16(UART3_IER_CLEAR)
#define bfin_write_UART3_IER_CLEAR(val) bfin_write16(UART3_IER_CLEAR, val)
#define bfin_read_UART3_THR() bfin_read16(UART3_THR)
#define bfin_write_UART3_THR(val) bfin_write16(UART3_THR, val)
#define bfin_read_UART3_RBR() bfin_read16(UART3_RBR)
#define bfin_write_UART3_RBR(val) bfin_write16(UART3_RBR, val)
/* NFC Registers */
#define bfin_read_NFC_CTL() bfin_read16(NFC_CTL)
#define bfin_write_NFC_CTL(val) bfin_write16(NFC_CTL, val)
#define bfin_read_NFC_STAT() bfin_read16(NFC_STAT)
#define bfin_write_NFC_STAT(val) bfin_write16(NFC_STAT, val)
#define bfin_read_NFC_IRQSTAT() bfin_read16(NFC_IRQSTAT)
#define bfin_write_NFC_IRQSTAT(val) bfin_write16(NFC_IRQSTAT, val)
#define bfin_read_NFC_IRQMASK() bfin_read16(NFC_IRQMASK)
#define bfin_write_NFC_IRQMASK(val) bfin_write16(NFC_IRQMASK, val)
#define bfin_read_NFC_ECC0() bfin_read16(NFC_ECC0)
#define bfin_write_NFC_ECC0(val) bfin_write16(NFC_ECC0, val)
#define bfin_read_NFC_ECC1() bfin_read16(NFC_ECC1)
#define bfin_write_NFC_ECC1(val) bfin_write16(NFC_ECC1, val)
#define bfin_read_NFC_ECC2() bfin_read16(NFC_ECC2)
#define bfin_write_NFC_ECC2(val) bfin_write16(NFC_ECC2, val)
#define bfin_read_NFC_ECC3() bfin_read16(NFC_ECC3)
#define bfin_write_NFC_ECC3(val) bfin_write16(NFC_ECC3, val)
#define bfin_read_NFC_COUNT() bfin_read16(NFC_COUNT)
#define bfin_write_NFC_COUNT(val) bfin_write16(NFC_COUNT, val)
#define bfin_read_NFC_RST() bfin_read16(NFC_RST)
#define bfin_write_NFC_RST(val) bfin_write16(NFC_RST, val)
#define bfin_read_NFC_PGCTL() bfin_read16(NFC_PGCTL)
#define bfin_write_NFC_PGCTL(val) bfin_write16(NFC_PGCTL, val)
#define bfin_read_NFC_READ() bfin_read16(NFC_READ)
#define bfin_write_NFC_READ(val) bfin_write16(NFC_READ, val)
#define bfin_read_NFC_ADDR() bfin_read16(NFC_ADDR)
#define bfin_write_NFC_ADDR(val) bfin_write16(NFC_ADDR, val)
#define bfin_read_NFC_CMD() bfin_read16(NFC_CMD)
#define bfin_write_NFC_CMD(val) bfin_write16(NFC_CMD, val)
#define bfin_read_NFC_DATA_WR() bfin_read16(NFC_DATA_WR)
#define bfin_write_NFC_DATA_WR(val) bfin_write16(NFC_DATA_WR, val)
#define bfin_read_NFC_DATA_RD() bfin_read16(NFC_DATA_RD)
#define bfin_write_NFC_DATA_RD(val) bfin_write16(NFC_DATA_RD, val)
/* Counter Registers */
#define bfin_read_CNT_CONFIG() bfin_read16(CNT_CONFIG)
#define bfin_write_CNT_CONFIG(val) bfin_write16(CNT_CONFIG, val)
#define bfin_read_CNT_IMASK() bfin_read16(CNT_IMASK)
#define bfin_write_CNT_IMASK(val) bfin_write16(CNT_IMASK, val)
#define bfin_read_CNT_STATUS() bfin_read16(CNT_STATUS)
#define bfin_write_CNT_STATUS(val) bfin_write16(CNT_STATUS, val)
#define bfin_read_CNT_COMMAND() bfin_read16(CNT_COMMAND)
#define bfin_write_CNT_COMMAND(val) bfin_write16(CNT_COMMAND, val)
#define bfin_read_CNT_DEBOUNCE() bfin_read16(CNT_DEBOUNCE)
#define bfin_write_CNT_DEBOUNCE(val) bfin_write16(CNT_DEBOUNCE, val)
#define bfin_read_CNT_COUNTER() bfin_read32(CNT_COUNTER)
#define bfin_write_CNT_COUNTER(val) bfin_write32(CNT_COUNTER, val)
#define bfin_read_CNT_MAX() bfin_read32(CNT_MAX)
#define bfin_write_CNT_MAX(val) bfin_write32(CNT_MAX, val)
#define bfin_read_CNT_MIN() bfin_read32(CNT_MIN)
#define bfin_write_CNT_MIN(val) bfin_write32(CNT_MIN, val)
/* Security Registers */
#define bfin_read_SECURE_SYSSWT() bfin_read32(SECURE_SYSSWT)
#define bfin_write_SECURE_SYSSWT(val) bfin_write32(SECURE_SYSSWT, val)
#define bfin_read_SECURE_CONTROL() bfin_read16(SECURE_CONTROL)
#define bfin_write_SECURE_CONTROL(val) bfin_write16(SECURE_CONTROL, val)
#define bfin_read_SECURE_STATUS() bfin_read16(SECURE_STATUS)
#define bfin_write_SECURE_STATUS(val) bfin_write16(SECURE_STATUS, val)
/* DMA Peribfin_read_()heral Mux Register */
#define bfin_read_DMAC1_PERIMUX() bfin_read16(DMAC1_PERIMUX)
#define bfin_write_DMAC1_PERIMUX(val) bfin_write16(DMAC1_PERIMUX, val)
/* Handshake MDMA is not defined in the shared file because it is not available on the ADSP-BF542 bfin_read_()rocessor */
#endif /* _CDEF_BF54X_H */
| code |
Indore to Dehradun flights. Cheap Air tickets in Indore Dehradun Flight.
Indore, the cultural center of the State of Madhya Pradesh, stands out to be one of the leading cities in India. The city connects with Dehradun thorough numerous flights every day. Devi Ahilyabai Holkar Airport (IATA: IDR; ICAO: VAID Role: Commercial), located in Indore, handles multiple flights every day. It stands on 22.7217 of latitude & 75.8008 of longitude. Its world-area-code is 733.
Everyday thousands of tourists use this airport to fly from Indore to other major destinations of the country including Delhi, Mumbai, Pune, Ahmedabad, Chennai and others. Get cheap flights from Indore (IDR) to Dehradun (DED) over net instantly and effortlessly. | english |
Give your dog a stong, durable yet stylish accessory to strut their stuff! Introducing Pet One ToughDog range of Collar’s, Lead’s and Harnesses.
Available in many colours and sizes, you will be sure to find the right accessory for your tough dog! | english |
ಭವಿಷ್ಯದಲ್ಲಿ ಚೀನಾಗೆ ಕಾದಿದೆಯಾ ಕಂಟಕ? ತಜ್ಞರು ಹೇಳಿದ್ದೇನು? ಚೀನಾ ಎಂಬ ದೈತ್ಯ ರಾಷ್ಟ್ರಕ್ಕೆ ಟೈಂ ಸರಿಯಿಲ್ಲ ಅಂತಾ ಕಾಣುತ್ತೆ. ಯಾಕಂದ್ರೆ ಎಲ್ಲವೂ ಒಂದೊಂದಾಗಿ ಉಲ್ಟಾ ಹೊಡೆಯುತ್ತಿದೆ. ಅತ್ತ ನಂಬರ್ 1 ರಾಷ್ಟ್ರ ಅಮೆರಿಕಗೆ ಸೆಡ್ಡು ಹೊಡೆಯುವ ರೀತಿ ಬೆಳೆದು ನಿಂತಿರುವ ಚೀನಾ ಒಂದೊಂದೇ ಸಂಕಷ್ಟದಲ್ಲಿ ಸಿಲುಕುತ್ತಿದೆ. ಕೊರೊನಾ ಚೀನಾದ ಸೃಷ್ಟಿ ಎಂದು ಇತ್ತೀಚೆಗೆ ಯುರೋಪ್ನ ಕೆಲ ತಜ್ಞರು ಆರೋಪ ಮಾಡಿದ್ದರು. ಇದಾದ ಬಳಿಕ ವ್ಯಾಕ್ಸಿನ್ ಮಾರಾಟದ ವಿಚಾರದಲ್ಲೂ ಚೀನಾ ಗೊಂದಲದಲ್ಲೇ ಒದ್ದಾಡುತ್ತಿದೆ. ಇದೆಲ್ಲಾ ಸಾಕು ಎನ್ನುವಷ್ಟರಲ್ಲಿ ಜನಸಂಖ್ಯೆ ಕಡಿಮೆಯಾಗುತ್ತಿರುವುದು ಚೀನಾ ಭವಿಷ್ಯಕ್ಕೆ ದೊಡ್ಡ ಅಪಾಯ ತಂದೊಡ್ಡಿದೆ. ಹೀಗಾಗಿಯೇ ಚೀನಾದಲ್ಲಿ ಆಡಳಿತ ನಡೆಸುತ್ತಿರುವ ಕಮ್ಯುನಿಸ್ಟ್ ಪಕ್ಷ ಹೊಸದೊಂದು ನಿಯಮ ಜಾರಿಗೆ ತರಲು ಮುಂದಾಗಿದ್ದು, ಇನ್ಮುಂದೆ ಮದುವೆಯಾದ ಜೋಡಿ ಗರಿಷ್ಠ ಮೂವರು ಮಕ್ಕಳನ್ನು ಹೊಂದಬಹುದು ಎಂದಿದೆ. ಆದರೆ ಚೀನಾ ಇಷ್ಟು ಮಾತ್ರ ಮಾಡಿದರೆ ಸಾಲದು ಎನ್ನುತ್ತಿದ್ದಾರೆ ತಜ್ಞರು. ಇದೀಗ ಚೀನಾ ಕೈಗೊಂಡ ಕ್ರಮದಿಂದ ಜನಸಂಖ್ಯೆ ಹಾಗೂ ವಯಸ್ಸಿನ ನಡುವೆ ಇರುವ ವ್ಯತ್ಯಾಸವೇನು ಸರಿಯಾಗದು. ಹೀಗಾಗಿ ಚೀನಾ ಜನಸಂಖ್ಯೆ ಕಾನೂನನ್ನೇ ಸಂಪೂರ್ಣ ತೆಗೆದು ಹಾಕಬೇಕಿದೆ ಎಂಬುದು ತಜ್ಞರ ಅಭಿಪ್ರಾಯ. ತಕ್ಷಣ ಕ್ರಮ ಅಗತ್ಯ..! ಚೀನಾ ಏನೇ ಮಾಡುವುದಿದ್ದರೂ ಈಗಲೇ ಮಾಡಬೇಕಿದೆ, ಏಕೆಂದರೆ ಚೀನಾದ ಜನಸಂಖ್ಯೆಯಲ್ಲಿ ವಯಸ್ಸಿನ ನಡುವಿನ ವ್ಯತ್ಯಾಸ ಕೈಮೀರಿ ಹೋಗಿದೆ. ಹೀಗಾಗಿ ಕೂಡಲೇ ಜನಸಂಖ್ಯೆ ಕುರಿತು ಇರುವ ಕಾನೂನಿಗೆ ಅಲ್ಲಿನ ಸರ್ಕಾರ ಎಳ್ಳುನೀರು ಬಿಡಬೇಕು. ಇಲ್ಲವಾದರೆ ಭವಿಷ್ಯದಲ್ಲಿ ದೊಡ್ಡ ಸಂಕಷ್ಟವೇ ಎದುರಾಗುವ ಸಾಧ್ಯತೆ ಇದೆ ಎಂದು ತಜ್ಞರು ಎಚ್ಚರಿಕೆ ನೀಡಿದ್ದಾರೆ. ಚೀನಾ ಹೊಸ ಕಾನೂನು ಜಗತ್ತಿನಾದ್ಯಂತ ದೊಡ್ಡ ಸದ್ದು ಮಾಡುತ್ತಿದ್ದು, ಎಲ್ಲೆಲ್ಲೂ ಚರ್ಚೆಯ ವಿಷಯವಾಗಿದೆ. ಚೀನಾ ಜನರು ಹೊಸ ನಿಯಮದ ಬಗ್ಗೆ ಸಂತಸ ವ್ಯಕ್ತಪಡಿಸುತ್ತಿದ್ದಾರೆ. 1980ರಿಂದ ಕಠಿಣ ಕಾನೂನು ಚೀನಾದಲ್ಲಿ ವಿಪರೀತವಾಗಿ ಜನಸಂಖ್ಯೆ ಏರುತ್ತಿತ್ತು. ಹೀಗಾಗಿಯೇ ಚೀನಾದಲ್ಲಿ ಜನಸಂಖ್ಯೆ ಬೆಳವಣಿಗೆಯನ್ನು ತಡೆಯಲು ಕಮ್ಯುನಿಸ್ಟ್ ಪಾರ್ಟಿ 1980ರಿಂದ ಜನನದ ಮಿತಿ ಜಾರಿಗೊಳಿಸಿತ್ತು. ಈ ಕಾನೂನಿನ ಪರಿಣಾಮ ಚೀನಾದಲ್ಲಿ 65 ವರ್ಷ ಮೇಲ್ಪಟ್ಟವರ ಸಂಖ್ಯೆ ಹೆಚ್ಚಾಗಿದ್ದು, ಸರಾಸರಿ ವಯಸ್ಸು ನಿಭಾಯಿಸುವುದು ಇದೀಗ ಕಷ್ಟವಾಗಿದೆ. ಹೀಗಾಗಿ ದುಡಿಯುವ ವರ್ಗ ಕೂಡ ಕುಸಿತ ಕಾಣುತ್ತಿರುವುದು ಚೀನಾಗೆ ಆತಂಕ ಹುಟ್ಟಿಸಿದೆ. ಇದೇ ಕಾರಣಕ್ಕೆ ಜನಸಂಖ್ಯೆ ಕಾನೂನಿನಲ್ಲಿ ಮಹತ್ವದ ಬದಲಾವಣೆ ಮಾಡಿ, ವಯಸ್ಸಿನ ಅಂತರ ಸರಿದೂಗಿಸಿ ಅಭಿವೃದ್ಧಿಗೆ ಪೂರಕವಾಗುವ ವಾತಾವರಣ ನಿರ್ಮಿಸುವುದು ಕಮ್ಯುನಿಸ್ಟ್ ಸರ್ಕಾರದ ಗುರಿಯಾಗಿದೆ. ಕಾರ್ಮಿಕರ ಕೊರತೆ ಅಪಾಯ..? ಯಾವುದೇ ದೇಶದ ಆರ್ಥಿಕತೆ ನಿರ್ಧಾರ ಆಗುವುದು ನೈಸರ್ಗಿಕ ಸಂಪತ್ತು ಹಾಗೂ ಶ್ರಮಿಕ ವರ್ಗದ ಮೇಲೆ. ಜನಸಂಖ್ಯೆ ಅಗತ್ಯಕ್ಕೆ ತಕ್ಕಷ್ಟು ಇರಬೇಕೆ ವಿನಃ, ಹೆಚ್ಚುಕಡಿಮೆಯಾದರೆ ಆರ್ಥಿಕತೆಗೆ ನೇರ ಪೆಟ್ಟು ಕೊಡಲಿದೆ. ಈ ಹಿಂದೆ ಚೀನಾದಲ್ಲಿ ಭಾರಿ ಪ್ರಮಾಣದಲ್ಲಿ ಜನಸಂಖ್ಯೆ ಏರಿಕೆ ಕಾಣುತ್ತಿತ್ತು. ಆದರೆ ಇದೀಗ ದಿಢೀರ್ ಕುಸಿತ ಕಾಣುತ್ತಿರುವುದು ಮುಂಬರುವ ದಿನಗಳಲ್ಲಿ ದೊಡ್ಡ ಪ್ರಮಾಣದಲ್ಲಿ ಕಾರ್ಮಿಕರು ಹಾಗೂ ಬಳಕೆದಾರರ ಕೊರತೆ ಎದುರಾಗುವ ಮುನ್ಸೂಚನೆ ನೀಡುತ್ತಿದೆ. ಜಗತ್ತಿನ 2ನೇ ಅತಿದೊಡ್ಡ ಆರ್ಥಿಕತೆಯ ರಾಷ್ಟ್ರಕ್ಕೆ ಜನಸಂಖ್ಯೆ ಕುಸಿತ ದೊಡ್ಡ ತಲೆನೋವು ತಂದೊಡ್ಡುತ್ತಿದೆ. 7ನೇ ರಾಷ್ಟ್ರೀಯ ಜನಗಣತಿ ಭಾರತದಲ್ಲಿ ನಡೆಯುವಂತೆ ಪ್ರತಿ 10 ವರ್ಷಕ್ಕೆ ಒಂದು ಬಾರಿ ಚೀನಾದಲ್ಲೂ ಜನಗಣತಿ ನಡೆಯುತ್ತದೆ. 7ನೇ ಜನಗಣತಿ ವರದಿಯನ್ನು ಬಿಡುಗಡೆ ಮಾಡಿರುವ ಚೀನಾ ಜನಸಂಖ್ಯೆ ಏರಿಳಿತದ ಬಗ್ಗೆ ಮಾಹಿತಿ ನೀಡಿದೆ. ಒಟ್ಟು 31 ಪ್ರಾಂತ್ಯಗಳು ಸೇರಿದಂತೆ ಚೀನಾದಲ್ಲಿ ವಾಸಿಸುತ್ತಿರುವ ಪ್ರಜೆಗಳ ವಿವರ ಇದರಲ್ಲಿದೆ. ಆದರೆ ಹಾಂಕಾಂಗ್ ಮತ್ತು ಮಕಾವೊ ಜನಸಂಖ್ಯೆ ವಿವರ ಈ ಜನಗಣತಿಯಲ್ಲಿ ಇಲ್ಲದಿರುವುದು ವಿಶೇಷ. ಚೀನಾದಲ್ಲಿ 60 ವರ್ಷ ಮೇಲ್ಪಟ್ಟವರ ಸಂಖ್ಯೆ 26 ಕೋಟಿಗೆ ಹೆಚ್ಚಳವಾಗಿದ್ದರೆ 1559 ವರ್ಷದೊಳಗಿನವರ ಸಂಖ್ಯೆಯು 89.4 ಕೋಟಿ ಇದೆ. ಚೀನಾದಲ್ಲಿ ನಗರ ಪ್ರದೇಶಗಳಲ್ಲಿ 90 ಕೋಟಿ ಹಾಗೂ ಗ್ರಾಮೀಣ ಪ್ರದೇಶಗಳಲ್ಲಿ 50 ಕೋಟಿ ಪ್ರಜೆಗಳು ವಾಸ ಮಾಡುತ್ತಿದ್ದಾರೆ. source: oneindia.com | kannad |
Subsets and Splits